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

On the Independent Domination Number of Regular Graphs

โœ Scribed by Wayne Goddard, Michael A. Henning, Jeremy Lyle, Justin Southey

Book ID
120770367
Publisher
Springer
Year
2012
Tongue
English
Weight
288 KB
Volume
16
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On domination and independent domination
On domination and independent domination numbers of a graph
โœ Robert B. Allan; Renu Laskar ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

On the independent domination number of
On the independent domination number of graphs with given minimum degree
โœ N.I. Glebov; A.V. Kostochka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A