𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper minus total domination in small-degree regular graphs

✍ Scribed by Hong Yan; Xiaoqi Yang; Erfang Shan

Book ID
108113756
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
266 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minus domination in regular graphs
Minus domination in regular graphs
✍ Jean Dunbar; Stephen Hedetniemi; Michael A. Henning; Alice A. McRae πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 77 KB
Minus total domination in graphs
Minus total domination in graphs
✍ Hua-Ming Xing; Hai-Long Liu πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 176 KB
Balloons, cut-edges, matchings, and tota
Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
✍ Suil O; Douglas B. West πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 148 KB πŸ‘ 1 views

## Abstract A __balloon__ in a graph __G__ is a maximal 2‐edge‐connected subgraph incident to exactly one cut‐edge of __G__. Let __b__(__G__) be the number of balloons, let __c__(__G__) be the number of cut‐edges, and let Ξ±β€²(__G__) be the maximum size of a matching. Let \documentclass{article}\usep

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 Ξ“~__