| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421036 | Discrete Applied Mathematics | 2006 | 8 Pages |
Abstract
A set S of vertices in a graph G=(V,E)G=(V,E) is a total dominating set of G if every vertex of VV is adjacent to a vertex in S . We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of VV are totally dominated by distinct subsets of the total dominating set.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Teresa W. Haynes, Michael A. Henning, Jamie Howard,