Article
Locating and Total Dominating Sets in Trees
Discrete Applied Mathematics
Document Type
Article
Publication Date
5-1-2006
Description
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.
Disciplines
Citation Information
Teresa W. Haynes, Michael A. Henning and Jamie Howard. "Locating and Total Dominating Sets in Trees" Discrete Applied Mathematics Vol. 154 Iss. 8 (2006) p. 1293 - 1300 ISSN: 0166-218X Available at: http://works.bepress.com/jamie-price/11/