Trees with unique minimum total dominating sets
Teresa W. Haynes, Michael A. Henning (2002)
Discussiones Mathematicae Graph Theory
Similarity:
A set S of vertices of a graph G is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. We provide three equivalent conditions for a tree to have a unique minimum total dominating set and give a constructive characterization of such trees.