Answers are grounded in this paper and cite their sources.
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).
No takes yet. Share an insight, caveat, or question.
Cockayne et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: