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

Total restrained domination in graphs with minimum degree two

โœ Scribed by M.A. Henning; J.E. Maritz

Book ID
108113818
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
206 KB
Volume
308
Category
Article
ISSN
0012-365X

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