A Characterization of Trees With Unique Minimum Double Dominating Sets
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a double dominating set if every vertex of V is dominated at least twice by the vertices of S. We give a constructive characterization of trees with unique minimum double dominating sets.
Chellali, Mustapha; and Haynes, Teresa W.. 2010. A Characterization of Trees With Unique Minimum Double Dominating Sets. Utilitas Mathematica. Vol.83 233-242. ISSN: 0315-3681