论文信息 - A note on the k-domination number of a graph

A note on the k-domination number of a graph

The k-domlnation number of a graph G G(V,E), Yk(G), is the least cardlnallty of a set X V such that any vertex in V X is adjacent to at least k vertices of X. Extending a result of Cockayne, Gamble and Shepherd 4 ), we prove that

Yair Caro | Yehuda Roditty

[1] D. R. Lick,et al. Graph theory with applications to algorithms and computer science , 1985 .

[2] F. Bruce Shepherd,et al. An upper bound for the k-domination number of a graph , 1985, J. Graph Theory.