The k-tuple domination number revisited
β
Vadim Zverovich
π
Article
π
2008
π
Elsevier Science
π
English
β 183 KB
The following fundamental result for the domination number Ξ³ (G) of a graph G was proved by Alon and Spencer, Arnautov, LovΓ‘sz and Payan: where n is the order and Ξ΄ is the minimum degree of vertices of G. A similar upper bound for the double domination number was found by Harant and Henning [J. Har