Domination critical graphs with higher independent domination numbers
Suqin Ao, E. J. Cockayne, Gary MacGillivray, Christina M. Mynhardt · Journal of Graph Theory · 1996
We show that for each k ≥ 4 there exists a connected k-domination critical graph with independent domination number exceeding k, thus disproving a conjecture of Sumner and Blitch (J. Combinatorial Theory B34 (1983), 65–76) in all cases except k = 3. © 1996 John Wiley & Sons, Inc.