Abstract
A set \(S\) of vertices in a graph \(G\) is a total dominating set if every vertex of \(G\) is adjacent to a vertex in \(S\). The minimum cardinality of a total dominating set of \(G\) is the total domination number of \(G\). Much interest in total domination in graphs has arisen from a computer program Graffiti.pc that has generated several hundred conjectures on total domination (see http://cms.dt.uh.edu/faculty/delavinae/research/wowII). We prove and disprove some conjectures from Graffiti.pc concerning lower bounds on the total domination number of a graph.
Similar content being viewed by others
References
Chellali M, Haynes TW (2004) Total and paired-domination numbers of a tree. AKCE Int J Graphs Comb 1:69–75
Chellali M, Haynes TW (2006) A note on the total domination of a tree. J Comb Math Comb Comput 58:189–193
DeLaViña E, Written on the wall II. http://cms.dt.uh.edu/faculty/delavinae/research/wowII
Desormeaux WJ, Haynes TW, Henning A, Yeo A (2013) Total domination numbers of graphs with diameter two. J Graph Theory 75(1):91–103
Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, Inc., New York
Henning MA (2009) Recent results on total domination in graphs: a survey. Discret Math 309:32–63
Henning MA, Yeo A (2013) Total domination in graphs, Springer Monographs in Mathematics. ISBN-13:978–1461465249
Hoffman AJ, Singleton RR (1960) On Moore graphs with diameter 2 and 3. IBM J Res Dev 5:497–504
Singleton RR (1968) There is no irregular Moore graph. Am Math Mon 75:42–43
Acknowledgments
Research supported in part by the University of Johannesburg and the South African National Research Foundation.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Desormeaux, W.J., Henning, M.A. Lower bounds on the total domination number of a graph. J Comb Optim 31, 52–66 (2016). https://doi.org/10.1007/s10878-014-9708-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9708-2