{
  "id": "math/0605071",
  "version": "v2",
  "published": "2006-05-02T18:18:49.000Z",
  "updated": "2006-05-02T23:09:35.000Z",
  "title": "Eigenvalues and extremal degrees in graphs",
  "authors": [
    "Vladimir Nikiforov"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2006-05-02T23:09:35.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50"
    ],
    "keywords": [
      "extremal degrees",
      "eigenvalues",
      "adjacency matrix",
      "maximum degrees"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math......5071N"
    }
  }
}