𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the vertex–edge domination number of a tree

✍ Scribed by Krishnakumari, Balakrishna; Venkatakrishnan, Yanamandram B.; Krzywkowski, Marcin


Book ID
122124671
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
201 KB
Volume
352
Category
Article
ISSN
1631-073X

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