A characterization of i-excellent trees

Teresa W. Haynes, Michael A. Henning

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)


The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. The graph G is called i-excellent if every vertex of G belongs to some i(G)-set. We provide a constructive characterization of i-excellent trees.

Original languageEnglish
Pages (from-to)69-77
Number of pages9
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - 6 Apr 2002
Externally publishedYes


  • Independent domination number
  • Trees

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'A characterization of i-excellent trees'. Together they form a unique fingerprint.

Cite this