| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513008 | Discrete Mathematics | 2005 | 10 Pages |
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. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Teresa W. Haynes, Michael A. Henning,