Domination Parameters of a Graph and Its Complement
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.
Desormeaux, Wyatt J.; Haynes, Teresa W.; and Henning, Michael A.. 2018. Domination Parameters of a Graph and Its Complement. Discussiones Mathematicae - Graph Theory. Vol.38(1). 203-215. https://doi.org/10.7151/dmgt.2002 ISSN: 1234-3099