An upper bound for the k‐domination number of a graph
EJ Cockayne, B Gamble, B Shepherd - Journal of graph theory, 1985 - Wiley Online Library
EJ Cockayne, B Gamble, B Shepherd
Journal of graph theory, 1985•Wiley Online LibraryAn upper bound for the k‐domination number of a graph - Cockayne - 1985 - Journal of Graph
Theory - Wiley Online Library Skip to Article Content Skip to Article Information Wiley Online
Library Wiley Online Library Search within Search term Advanced Search Citation Search
Search term Advanced Search Citation Search Roman Journal of Graph Theory Volume 9,
Issue 4 p. 533-534 Journal of Graph Theory Article Full Access An upper bound for the
k-domination number of a graph EJ Cockayne, EJ Cockayne University of Victoria, Victoria …
Theory - Wiley Online Library Skip to Article Content Skip to Article Information Wiley Online
Library Wiley Online Library Search within Search term Advanced Search Citation Search
Search term Advanced Search Citation Search Roman Journal of Graph Theory Volume 9,
Issue 4 p. 533-534 Journal of Graph Theory Article Full Access An upper bound for the
k-domination number of a graph EJ Cockayne, EJ Cockayne University of Victoria, Victoria …
Abstract
The k‐domination number of a graph G, γk(G), is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k, then γk(G) ≤ kp/(k + 1).