Note: The diameter of edge domination critical graphs
Matteo G. A. Paris · Networks · 1994
Abstract The best previous upper bound on the diameter of an edge domination critical graph with domination number γ is 3γ ‐ 5, found in a paper by Fulman. We improve the bound by one and exhibit a class of edge critical graphs with diameter [⅔γ ‐ 1]. © 1994 by John Wiley & Sons, Inc.