{
  "id": "1307.0168",
  "version": "v1",
  "published": "2013-06-30T01:57:39.000Z",
  "updated": "2013-06-30T01:57:39.000Z",
  "title": "The Algebraic Connectivity and the Clique Number of Graphs",
  "authors": [
    "Ya-Lei Jin",
    "Xiao-Dong Zhang"
  ],
  "comment": "18pages, 4figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum the algebraic connectivity among all graphs of order $n$ with the clique number $r$, respectively. In turn, an upper and lower bounds for the clique number of a graph in terms of the algebraic connectivity are obtained. Moreover, a spectral version of the Erd\\H{o}s-Stone theorem in terms of the algebraic connectivity of graphs is presented.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-06-30T01:57:39.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50"
    ],
    "keywords": [
      "algebraic connectivity",
      "clique number",
      "lower bounds",
      "spectral version",
      "extremal graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1307.0168J"
    }
  }
}