𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the locating-total domination number of a tree

✍ Scribed by Xue-gang Chen; Moo Young Sohn

Book ID
108112914
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
223 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the -domination number of a gr
Bounds on the -domination number of a graph
✍ 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