2017/05/04 by Yu, Guidong, Fang, Yi, Fan, Yizheng +1
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1705.01683
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.