math.CO

(what is this?)

# Title: On the $k$-independence number of graphs

Abstract: 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.
 Subjects: Combinatorics (math.CO) MSC classes: 05C50, 05C69 Cite as: arXiv:1803.07042 [math.CO] (or arXiv:1803.07042v1 [math.CO] for this version)

## Submission history

From: Miquel Àngel Fiol [view email]
[v1] Mon, 19 Mar 2018 17:13:36 GMT (11kb)