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

In this paper we use the degree sequence, order, size and vertex connectivity of a K1,r+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.