Some toughness results in independent domination critical graphs
Nawarat Ananchuen, Watcharaphong Ananchuen · Discussiones Mathematicae Graph Theory · 2015
A subset S of V (G) is an independent dominating set of G if S is independent and each vertex of G is either in S or adjacent to some vertex of S. Let i(G) denote the minimum cardinality of an independent dominating set of