An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. Independent dominating sets are equivalent to maximal independent vertex sets. The minimum size of an independent dominating set in a graph is known as its independent domination number (Crevals and Östergård 2015, Ilić and Milošević 2017). Since any maximal independent vertex set is also a minimal dominating set, the independent domination number is equivalent to the lower independence number.

dominating set | independent vertex set | lower independence number