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. © 2005 Elsevier B.V. All rights reserved.
Haynes, T. W., & Henning, M. A. (2005). Trees with two disjoint minimum independent dominating sets. Discrete Mathematics, 304(1–3), 69–78. https://doi.org/10.1016/j.disc.2005.09.012