Geodesic
Vertices contained in all minimum paired-dominating sets of a tree
Czechoslovak Mathematical Journal, Tome 57 (2007) no. 1, pp. 407-417.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ and $\langle S\rangle $ contains at least one perfect matching. We characterize the set of vertices of a tree that are contained in all minimum paired-dominating sets of the tree.
Classification : 05C05, 05C35, 05C69
Keywords: domination number; paired-domination number; tree 
@article{CMJ_2007__57_1_a30,
     author = {Chen, Xue-Gang},
     title = {Vertices contained in all minimum paired-dominating sets of a tree},
     journal = {Czechoslovak Mathematical Journal},
     pages = {407--417},
     publisher = {mathdoc},
     volume = {57},
     number = {1},
     year = {2007},
     mrnumber = {2309974},
     zbl = {1174.05090},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2007__57_1_a30/}
}
TY  - JOUR
AU  - Chen, Xue-Gang
TI  - Vertices contained in all minimum paired-dominating sets of a tree
JO  - Czechoslovak Mathematical Journal
PY  - 2007
SP  - 407
EP  - 417
VL  - 57
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CMJ_2007__57_1_a30/
LA  - en
ID  - CMJ_2007__57_1_a30
ER  - 
%0 Journal Article
%A Chen, Xue-Gang
%T Vertices contained in all minimum paired-dominating sets of a tree
%J Czechoslovak Mathematical Journal
%D 2007
%P 407-417
%V 57
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CMJ_2007__57_1_a30/
%G en
%F CMJ_2007__57_1_a30
Chen, Xue-Gang. Vertices contained in all minimum paired-dominating sets of a tree. Czechoslovak Mathematical Journal, Tome 57 (2007) no. 1, pp. 407-417. http://geodesic.mathdoc.fr/item/CMJ_2007__57_1_a30/