✦ LIBER ✦

Minimum independent generalized t-degree and independence number in K1,r+1-free graphs

✍ Scribed by O. Favaron; Y. Redouane

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 448 KB
Volume: 165-166
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00175-6

No coin nor oath required. For personal study only.

✦ Synopsis

The minimum independent generalized t-degree of a graph G = (V,E) is ut = min{ IN(H H is an independent set of t vertices of G}, with N(H) = UxtH N(x). In a KI,~+I -free graph, we give an upper bound on u! in terms of r and the independence number CI of G. This generalizes already known results on u2 in KI,,+I-free graphs and on U, in KI,x-free graphs.

📜 SIMILAR VOLUMES

On independent generalized degrees and i

On independent generalized degrees and independence numbers in K(1, m)-free graphs

✍ R.J. Faudree; R.J. Gould; M.S. Jacobson; L.M. Lesniak; T.E. Lindquester 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 427 KB

On the independence number in K1, r+1-fr

On the independence number in K1, r+1-free graphs

✍ Zdeněk Ryjáček; Ingo Schiermeyer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 353 KB

In this paper we use the degree sequence, order, size and vertex connectivity of a K 1,,+ 1 -free graph or of an almost claw-free graph to obtain several upper bounds on its independence number. We also discuss the sharpness of these results.