Abstract
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.
| Original language | American English |
|---|---|
| Journal | Discrete Applied Mathematics |
| Volume | 154 |
| DOIs | |
| State | Published - May 1 2006 |
Keywords
- differentiating-total dominating set
- locating-total dominating set
- metric-locating-total dominating set
Disciplines
- Early Childhood Education
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS