{
  "id": "1705.01683",
  "version": "v1",
  "published": "2017-05-04T02:56:42.000Z",
  "updated": "2017-05-04T02:56:42.000Z",
  "title": "Spectral Radius and Hamiltonicity of graphs",
  "authors": [
    "Guidong Yu",
    "Yi Fang",
    "Yizheng Fan",
    "Gaixiang Cai"
  ],
  "comment": "21 pages, 2 figures. arXiv admin note: text overlap with arXiv:1602.01033 by other authors",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph $G$ to be Hamilton-connected and traceable for every vertex in terms of the spectral radius of the graph or its complement respectively. Secondly, we give the conditions for a bipartite graph $G=(X,Y;E)$ with $|X|=|Y|+1$ to be traceable in terms of spectral radius, signless Laplacian spectral radius of the graph or its quasi-complement respectively.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-05-04T02:56:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hamiltonicity",
      "signless laplacian spectral radius",
      "large minimum degree",
      "bipartite graph",
      "conditions"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}