Title

Trees With Two Disjoint Minimum Independent Dominating Sets

Document Type

Article

Publication Date

11-28-2005

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. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets.

Share

COinS