Locating and Total Dominating Sets in Trees
A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
Haynes, Teresa W.; Henning, Michael A.; and Howard, Jamie. 2006. Locating and Total Dominating Sets in Trees. Discrete Applied Mathematics. Vol.154(8). 1293-1300. https://doi.org/10.1016/j.dam.2006.01.002 ISSN: 0166-218X