An upper bound for the k-domination number of a graph

Sorry, there's nothing here.

Cite this paper

@article{Cockayne1985AnUB, title={An upper bound for the k-domination number of a graph}, author={Ernest J. Cockayne and B. Gamble and F. Bruce Shepherd}, journal={Journal of Graph Theory}, year={1985}, volume={9}, pages={533-534} }