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

Domination versus independent domination in cubic graphs

โœ Scribed by Southey, Justin; Henning, Michael A.

Book ID
122627721
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
433 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Restrained domination in cubic graphs
Restrained domination in cubic graphs
โœ Johannes H. Hattingh; Ernst J. Joubert ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer US ๐ŸŒ English โš– 500 KB
Independent domination in regular graphs
Independent domination in regular graphs
โœ Julie Haviland ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 387 KB

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of th

Domination critical graphs with higher i
Domination critical graphs with higher independent domination numbers
โœ Ao, S.; Cockayne, E.J.; MacGillivray, G.; Mynhardt, C.M. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 348 KB ๐Ÿ‘ 2 views

We show that for each k L 4 there exists a connected k-domination critical graph with independent domination number exceeding k, thus disproving a conjecture of Sumner and Blitch ( J Cornbinatorial Theory B 34 (19831, 65-76) in all cases except k = 3.