Total domination excellent trees

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S (other than itself). The graph G is called total domination excellent if every vertex belongs to some total dominating set of G of minimum cardinality. We provide a constructive characterization of total domination excellent trees.

Original languageEnglish
Pages (from-to)93-104
Number of pages12
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - 28 Feb 2003
Externally publishedYes


  • Total domination
  • Tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


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

Cite this