Nordhaus–Gaddum bounds for total dominat
✍
Michael A. Henning; Ernst J. Joubert; Justin Southey
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 227 KB
A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper we continue the study of Nordhaus-Gaddum bounds for the total domination number γ t . Let G be a graph on n vertices and let G denote the complement of G,