Spectral Radius and Hamiltonicity of graphs
Abstract
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement respectively. Secondly, we give the conditions for a nearly balanced bipartite graph to be traceable in terms of spectral radius, signless Laplacian spectral radius of the graph or its quasi-complement respectively.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2017
- DOI:
- 10.48550/arXiv.1705.01683
- arXiv:
- arXiv:1705.01683
- Bibcode:
- 2017arXiv170501683Y
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 21 pages, 2 figures. arXiv admin note: text overlap with arXiv:1602.01033 by other authors