Vertices contained in all minimum paired-dominating sets of a tree
Czechoslovak Mathematical Journal, Tome 57 (2007) no. 1, pp. 407-417
Cet article a éte moissonné depuis 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.
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
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},
year = {2007},
volume = {57},
number = {1},
mrnumber = {2309974},
zbl = {1174.05090},
language = {en},
url = {http://geodesic.mathdoc.fr/item/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/