Spectral radius and Hamiltonicity of graphs with large minimum degree
Spectral radius and Hamiltonicity of graphs with large minimum degree
复制标题
DOI：
10.1007/s10587-016-0301-y
复制
发表时间：
2016-02
影响因子：
0.5
通讯作者：
V. Nikiforov
中科院分区：
文献类型：
--
作者：
V. Nikiforov
LetGbe a graph of ordernand λ(G) the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles inG. One of the main results of the paper is the following theoremLetk≥ 2,n≥k3+k+ 4, and letGbe a graph of ordern, with minimum degreeδ(G) ≥k. If, thenGhas a Hamiltonian cycle, unlessG=K1∨(Kn−k−1+Kk) orG=Kk∨(Kn−2k+).
