𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Total domination in partitioned trees and partitioned graphs with minimum degree two

✍ Scribed by Allan Frendrup; Michael A. Henning; Preben Dahl Vestergaard

Publisher
Springer US
Year
2007
Tongue
English
Weight
266 KB
Volume
41
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Domination in graphs with minimum degree
Domination in graphs with minimum degree two
✍ William McCuaig; Bruce Shepherd πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

The domination number y ( G ) of a graph G = (V E ) is the minimum cardinality of a subset of Vsuch that every vertex is either in the set or is adjacent to some vertex in the set. We show that if a connected graph G has minimum2degree two and is not one of seven exceptional graphs, then y ( g ) I ~

Total domination in graphs with minimum
Total domination in graphs with minimum degree three
✍ Favaron, Odile; Henning, Michael A.; Mynhart, Christina M.; Puech, JoοΏ½l πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 3 views

A set S of vertices of a graph G is a total dominating set, if every vertex of V (G) is adjacent to some vertex in S. The total domination number of G, denoted by Ξ³ t (G), is the minimum cardinality of a total dominating set of G. We prove that, if G is a graph of order n with minimum degree at leas

Domination number in graphs with minimum
Domination number in graphs with minimum degree two
✍ Er Fang Shan; Moo Young Sohn; Xu Dong Yuan; Michael A. Henning πŸ“‚ Article πŸ“… 2009 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 264 KB
Bounds related to domination in graphs w
Bounds related to domination in graphs with minimum degree two
✍ Sanchis, Laura A. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 157 KB πŸ‘ 2 views

A dominating set for a graph G = (V, E) is a subset of vertices V βŠ† V such that for all v ∈ V -V there exists some u ∈ V for which {v, u} ∈ E. The domination number of G is the size of its smallest dominating set(s). We show that for almost all connected graphs with minimum degree at least 2 and q e