A. Abiad, G. Coutinho, M. A. Fiol
Published 2018-03-19Version 1
This paper improves and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature follow as a corollary of the main results in this work.
A new class of polynomials from to the spectrum of a graph, and its application to bound the $k$-independence number
On the independence number of graphs related to a polarity
Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
![QR code for arXiv:1803.07042 [math.CO]](http://oss.arxitics.com/images/favicon.svg)