Abstract
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 language | English |
---|---|
Pages (from-to) | 69-77 |
Number of pages | 9 |
Journal | Discrete Mathematics |
Volume | 248 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 6 Apr 2002 |
Externally published | Yes |
Keywords
- Independent domination number
- Trees
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics