A linear vizing-like relation between the size and the domination number of a graph
Dieter Rautenbach · Journal of Graph Theory · 1999
We prove m ≤ Δn − (Δ + 1)γ for every graph without isolated vertices of order n, size m, domination number γ and maximum degree Δ ≥ 3. This generalizes a result of Fisher et al., CU-Denver Tech Rep, 1996] who obtained the given bound for the case Δ = 3. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 297–302, 1999