Restrained domination excellent trees

Johannes H. Hattingh, Michael A. Henning

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


A set S of vertices in a graph G = (V, E) is a restrained dominating set of G if every vertex not in S is adjacent to a vertex in S and to a vertex in V \ S. The graph G is called restrained domination excellent if every vertex belongs to some minimum restrained dominating set of G. We provide a characterization of restrained domination excellent trees.

Original languageEnglish
Pages (from-to)337-351
Number of pages15
JournalArs Combinatoria
Publication statusPublished - Apr 2008
Externally publishedYes


  • Excellent trees
  • Restrained domination

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Restrained domination excellent trees'. Together they form a unique fingerprint.

Cite this