A note on the -domination number of a graph
Received30 Dec 1988
Revised01 Feb 1989
The -domination number of a graph , , is the least cardinality of a set such that any vertex in is adjacent to at least vertices of .Extending a result of Cockayne, Gamble and Shepherd , we prove that if , , then, , where is the order of .
Copyright © 1990 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.