Guidong Yu, Yi Fang, Yizheng Fan, Gaixiang Cai
Published 2017-05-04Version 1
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.
Comments: 21 pages, 2 figures. arXiv admin note: text overlap with arXiv:1602.01033 by other authors
Bipartite graphs are weak antimagic
On a Generalization of the Bipartite Graph $D(k,q)$
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
![QR code for arXiv:1705.01683 [math.CO]](http://oss.arxitics.com/images/favicon.svg)