Well irredundant graphs

Irredundance in inflated graphs

✍ Favaron, Odile 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB 👁 2 views

The inflation G I of a graph G with n(G) vertices and m(G) edges is obtained by replacing every vertex of degree d of G by a clique K d . We study the lower and upper irredundance parameters ir and IR of an inflation. We prove in particular that if γ denotes the domination number of a graph, γ(G I )

Irredundant ramsey numbers for graphs

✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

Irredundancy in circular arc graphs

✍ Martin Charles Golumbic; Renu C. Laskar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 676 KB

CO-irredundant Ramsey numbers for graphs

✍ E. J. Cockayne; G. MacGillivray; J. Simmons 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

On irredundant Ramsey numbers for graphs

✍ Johannes H. Hattingh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest p such that in every two‐coloring of the edges of __K~p~__ using colors red (__R__) and blue (__B__), either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. We

Irredundance perfect andP6-free graphs

✍ Puech, Jo�l 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 2 views

The domination number γ(G) and the irredundance number ir(G) of a graph G have been considered by many authors. It is well known that ir(G) ≤ γ(G) holds for all graphs G, which leads us to consider the concept of irredundance perfect graphs: graphs that have all their induced subgraphs satisfying th