Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. Distance domination critical graphs. (English) Zbl 1035.05064 J. Comb. Math. Comb. Comput. 44, 33-45 (2003). The authors consider the notion of distance domination critical graph, which is basically identical to the concept of domination criticality restricted to powers of graphs. This notion was motivated by D. P. Sumner [Discrete Math. 86, 33–46 (1990; Zbl 0725.05049)]. In this study some properties of distance domination critical graphs and questions on embeddings are treated. Reviewer: Bert Randerath (Köln) Cited in 7 Documents MSC: 05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) 05C12 Distance in graphs Citations:Zbl 0725.05049 PDFBibTeX XMLCite \textit{M. A. Henning} et al., J. Comb. Math. Comb. Comput. 44, 33--45 (2003; Zbl 1035.05064)