The independent domination number of a graph is the minimum size of an independent dominating set (Crevals and Östergård 2015, Ilić and Milošević 2017). Since any maximal independent vertex set is also minimal dominating, the independent domination number is equivalent to the lower independence number.
