Trees with two disjoint minimum independent dominating sets

The independent domination number of a graph G, denoted image, is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality image in G we call an image-set. In this paper we provide a constructive characterization of trees G that have two disjoint image-sets.