A note on NordhausGaddum inequalities for domination
For a graph G of order n, let ?(G), ?2(G) and ?t(G) be the domination, double domination and total domination numbers of G, respectively. The minimum degree of the vertices of G is denoted by ?(G) and the maximum degree by ?(G). In this note we prove a conjecture due to Harary and Haynes saying that if a graph G has , then
domination double domination total domination