Restrained Domination in Self-Complementary Graphs

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

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S. The restrained domination number of a graph G is the minimum cardinality of a restrained dominating set of G. In this paper, we study restrained domination in self-complementary graphs. In particular, we characterize the self-complementary graphs having equal domination and restrained domination numbers.

Original languageEnglish
Pages (from-to)633-645
Number of pages13
JournalDiscussiones Mathematicae - Graph Theory
Issue number2
Publication statusPublished - 1 May 2021


  • complement
  • domination
  • restrained domination
  • self-complementary graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Restrained Domination in Self-Complementary Graphs'. Together they form a unique fingerprint.

Cite this