𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds on the total domination number of a graph

✍ Scribed by Desormeaux, Wyatt J.; Henning, Michael A.


Book ID
121559852
Publisher
Springer US
Year
2014
Tongue
English
Weight
269 KB
Volume
31
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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