Spectral radius and Hamiltonicity of graphs with large minimum degree
Abstract
Let G be a graph of order n and λ(G) the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. One of the main results of the paper is the following theorem Let k ≥ 2, n ≥ k3 + k + 4, and let G be a graph of order n, with minimum degree δ(G) ≥ k. If λ(G) ≥ n - k - 1, then G has a Hamiltonian cycle, unless G = K1∨(Kn−k−1+Kk) or G = Kk∨(Kn−2k+ K¯ k).
Publication Title
Czechoslovak Mathematical Journal
Recommended Citation
Nikiforov, V. (2016). Spectral radius and Hamiltonicity of graphs with large minimum degree. Czechoslovak Mathematical Journal, 66 (3), 925-940. https://doi.org/10.1007/s10587-016-0301-y
COinS
