Abstract
A set S of vertices of a graph G is a total dominating set, if every vertex of V(G) is adjacent to some vertex in S. The total domination number of G, denoted by γt(G), is the minimum cardinality of a total dominating set of G. We prove that, if G is a graph of order n with minimum degree at least 3, then γt(G) ≤ 7n/13.
Original language | English |
---|---|
Pages (from-to) | 9-19 |
Number of pages | 11 |
Journal | Journal of Graph Theory |
Volume | 34 |
Issue number | 1 |
DOIs | |
Publication status | Published - May 2000 |
Externally published | Yes |
Keywords
- Bounds
- Minimum degree three
- Total domination number
ASJC Scopus subject areas
- Geometry and Topology