Domination critical graphs with higher independent domination numbers

@article{Ao1996DominationCG,
  title={Domination critical graphs with higher independent domination numbers},
  author={S. Ao and Ernest J. Cockayne and Gary MacGillivray and Christina M. Mynhardt},
  journal={Journal of Graph Theory},
  year={1996},
  volume={22},
  pages={9-14}
}
We show that for each k L 4 there exists a connected k-domination critical graph with independent domination number exceeding k, thus disproving a conjecture of Sumner and Blitch (J Cornbinatorial Theory B 34 (19831, 65-76) in all cases except k = 3. 
Highly Cited
This paper has 28 citations. REVIEW CITATIONS