×

n-domination in graphs. (English) Zbl 0573.05049

Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 283-300 (1985).
[For the entire collection see Zbl 0564.00004.]
The k-domination number of a graph G is the smallest order of a set D such that for all \(x\in V(G)\)-D there are at least k neighbors of x in D. Various bounds and exact values for this parameter are presented.
Reviewer: J.PlesnĂ­k

MSC:

05C99 Graph theory

Citations:

Zbl 0564.00004