A note on the k‐domination number of a graph
Yair Caro, Y. Roditty · International Journal of Mathematics and Mathematical Sciences · 1989
The k‐domination number of a graph G = G(V, E), γk(G), is the least cardinality of a set X ⊂ V such that any vertex in VX is adjacent to at least k vertices of X. Extending a result of Cockayne, Gamble and Shepherd [4], we prove that if , n ≥ 1, k ≥ 1 then, , where p is the order of G.