Abstract
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S (other than itself). The graph G is called total domination excellent if every vertex belongs to some total dominating set of G of minimum cardinality. We provide a constructive characterization of total domination excellent trees.
| Original language | English |
|---|---|
| Pages (from-to) | 93-104 |
| Number of pages | 12 |
| Journal | Discrete Mathematics |
| Volume | 263 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 28 Feb 2003 |
| Externally published | Yes |
Keywords
- Total domination
- Tree
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics