Total domination in graphs with minimum degree three
Odile Favaron, Michael A. Henning, Christina M. Mynhart, Jo�l Puech · Journal of Graph Theory · 2000
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. © 2000 John Wiley & Sons, Inc. J Graph Theory 34:9–19, 2000