{
  "id": "math/0702723",
  "version": "v3",
  "published": "2007-02-24T00:27:30.000Z",
  "updated": "2007-06-06T21:09:20.000Z",
  "title": "Chromatic number and spectral radius",
  "authors": [
    "Vladimir Nikiforov"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Let G be a graph, H be its chromatic number, L be the largest eigenvalue of its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then, complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M",
  "revisions": [
    {
      "version": "v3",
      "updated": "2007-06-06T21:09:20.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50"
    ],
    "keywords": [
      "chromatic number",
      "spectral radius",
      "largest eigenvalue",
      "well-known result"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007math......2723N"
    }
  }
}