Domination parameters of a graph and its complement

Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)203-215
Number of pages13
JournalDiscussiones Mathematicae - Graph Theory
Issue number1
Publication statusPublished - 2018


  • Clique domination
  • Complement
  • Connected domination
  • Domination
  • Restrained domination
  • Total domination

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Domination parameters of a graph and its complement'. Together they form a unique fingerprint.

Cite this