𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper Bounds on the Paired Domination Subdivision Number of a Graph

✍ Scribed by Yoshimi Egawa, Michitaka Furuya, Masanori Takatou

Book ID
120788707
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
221 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Upper bounds on the paired-domination nu
Upper bounds on the paired-domination number
✍ Xue-gang Chen; Wai Chee Shiu; Wai Hong Chan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 199 KB

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paireddomination number of G, denoted by Ξ³ pr (G). In this w

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