Trees With Unique Minimum Paired-Dominating Sets
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. We characterize the trees having unique minimum paired-dominating sets.
Chellali, Mustapha; and Haynes, Teresa W.. 2004. Trees With Unique Minimum Paired-Dominating Sets. Ars Combinatoria. Vol.73 3-12. ISSN: 0381-7032