Graphs and Their Complements With Equal Total Domination Numbers
Document Type
Article
Publication Date
11-1-2013
Description
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. The minimum cardinality of a total dominating set of G is the total domination number of G. We study graphs having the same total domination number as their complements. In particular, we characterize the cubic graphs having this property. Also we characterize such graphs with total domination numbers equal to two or three, and we determine properties of the ones with larger total domination numbers.
Citation Information
Desormeaux, Wyatt J.; Haynes, Teresa W.; and Van Der Merwe, Lucas. 2013. Graphs and Their Complements With Equal Total Domination Numbers. Journal of Combinatorial Mathematics and Combinatorial Computing. Vol.87 321-333. ISSN: 0835-3026