Title

A Characterization of I-Excellent Trees

Document Type

Article

Publication Date

4-6-2002

Description

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.

Share

COinS