Spectral Radius and Hamiltonicity of graphs
Combinatorics
2017-11-29 v2
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.
Keywords
Cite
@article{arxiv.1705.01683,
title = {Spectral Radius and Hamiltonicity of graphs},
author = {Guidong Yu and Yi Fang and Yizheng Fan and Gaixiang Cai},
journal= {arXiv preprint arXiv:1705.01683},
year = {2017}
}
Comments
21 pages, 2 figures. arXiv admin note: text overlap with arXiv:1602.01033 by other authors