C. D. Godsil, M. W. Newman
Published 2005-08-03Version 1
We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate further properties of our bounds, and show how our results on the Erd\H{o}s-R\'{e}nyi graphs can be extended to other polarity graphs.
New approach to the $k$-independence number of a graph
A characterization of trees with equal 2-domination and 2-independence numbers
On the $k$-independence number of graphs
![QR code for arXiv:math/0508081 [math.CO]](http://oss.arxitics.com/images/favicon.svg)