{
  "id": "math/0602028",
  "version": "v1",
  "published": "2006-02-01T19:38:55.000Z",
  "updated": "2006-02-01T19:38:55.000Z",
  "title": "Spectral Radius and maximum degree of connected graphs",
  "authors": [
    "Vladimir Nikiforov"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of Stevanovic, Zhang, and Alon and Sudakov.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-02-01T19:38:55.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "15A42"
    ],
    "keywords": [
      "maximum degree",
      "connected graph",
      "spectral radius",
      "upper bound",
      "maximal eigenvalue"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math......2028N"
    }
  }
}