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.
Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-20173 |
Date | 06 April 2002 |
Creators | Haynes, Teresa W., Henning, Michael A. |
Publisher | Digital Commons @ East Tennessee State University |
Source Sets | East Tennessee State University |
Detected Language | English |
Type | text |
Source | ETSU Faculty Works |
Page generated in 0.0016 seconds