A Characterization of I-Excellent Trees
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.
Haynes, Teresa W.; and Henning, Michael A.. 2002. A Characterization of I-Excellent Trees. Discrete Mathematics. Vol.248(1-3). 69-77. https://doi.org/10.1016/S0012-365X(01)00274-6 ISSN: 0012-365X