๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Paired-domination in generalized claw-free graphs

โœ Scribed by Paul Dorbec; Sylvain Gravier; Michael A. Henning

Publisher
Springer US
Year
2006
Tongue
English
Weight
191 KB
Volume
14
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Paired-Domination inP5-Free Graphs
Paired-Domination inP5-Free Graphs
โœ Paul Dorbec; Sylvain Gravier ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 189 KB
Upper total domination in claw-free grap
Upper total domination in claw-free graphs
โœ 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 ฮ“~__