Bounds on the -domination number of a gr
β
Ermelinda DeLaViΓ±a; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug
π
Article
π
2011
π
Elsevier Science
π
English
β 200 KB
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part