{
  "id": "1803.07042",
  "version": "v1",
  "published": "2018-03-19T17:13:36.000Z",
  "updated": "2018-03-19T17:13:36.000Z",
  "title": "On the $k$-independence number of graphs",
  "authors": [
    "A. Abiad",
    "G. Coutinho",
    "M. A. Fiol"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-03-19T17:13:36.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50",
      "05C69"
    ],
    "keywords": [
      "independence number",
      "existing spectral bounds",
      "pairwise distance greater",
      "main results",
      "literature"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}