Domination parameters of a graph and its complement
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning · Discussiones Mathematicae Graph Theory · 2017
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.