Total domination in graphs with minimum degree three

Authors
Favaron, O Henning, MA Mynhart, CM Puech, J
Citation
O. Favaron et al., Total domination in graphs with minimum degree three, J GRAPH TH, 34(1), 2000, pp. 9-19
Citations number
9
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
34
Issue
1
Year of publication
2000
Pages
9 - 19
Database
ISI
SICI code
0364-9024(200005)34:1<9:TDIGWM>2.0.ZU;2-P
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 gamma(t)(G), is the minimum cardinality of a total dominating s et of G. We prove that, if G is a graph of order n with minimum degree at l east 3, then gamma(t)(G) less than or equal to 7n/13, (C) 2000 John Wiley & Sons, Inc.