𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper minus domination in a claw-free cubic graph

✍ Scribed by Weiping Shang; Jinjiang Yuan


Book ID
108113580
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
170 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Upper total domination in claw-free grap
✍ Odile Favaron; Michael A. Henning πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 114 KB

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__ (other than itself). The maximum cardinality of a minimal total dominating set of __G__ is the upper total domination number of __G__, denoted by Ξ“~__

Paired-Domination in Claw-Free Graphs
✍ Shenwei Huang, Liying Kang, Erfang Shan πŸ“‚ Article πŸ“… 2012 πŸ› Springer Japan 🌐 English βš– 382 KB