𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inflated graphs with equal independence number and upper irredundance number

✍ Scribed by Odile Favaron

Book ID
108315607
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
190 KB
Volume
236
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The sequence of upper and lower dominati
The sequence of upper and lower domination, independence and irredundance numbers of a graph
✍ E.J. Cockayne; C.M. Mynhardt πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 803 KB

Necessary and sufficient conditions are established for the existence of a graph whose upper and lower domination, independence and irredundance numbers are six given positive integers. This result shows that the only relationships between these six parameters which hold for all graphs and which do

On graphs with equal domination and inde
On graphs with equal domination and independent domination numbers
✍ Jerzy Topp; Lutz Volkmann πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 284 KB

Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80. Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal d

Characterization of graphs with equal do
Characterization of graphs with equal domination and covering number
✍ Bert Randerath; Lutz Volkmann πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 592 KB

Let G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not in D is adjacent to some vertex in D, and D is a covering if every edge of G has at least one end in D. The domination number 7(G) is the minimum order of a dominating set, and the covering number/~(G) is th