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 ≥ k 3 + k + 4, and let G be a graph of order n, with minimum degree δ(G) ≥ k. If
, then G has a Hamiltonian cycle, unless G = K 1∨(K n−k−1+K k ) or G = K k ∨(K n−2k + \({\bar K_k}\) ).
Similar content being viewed by others
References
V. I. Benediktovich: Spectral condition for Hamiltonicity of a graph. Linear Algebra Appl. 494 (2016), 70–79.
B. Bollobás: Modern Graph Theory. Graduate Texts in Mathematics 184, Springer, New York, 1998.
J. A. Bondy, V. Chvátal: A method in graph theory. Discrete Math. 15 (1976), 111–135.
S. Butler, F. Chung: Small spectral gap in the combinatorial Laplacian implies Hamiltonian. Ann. Comb. 13 (2010), 403–412.
V. Chvátal: On Hamilton’s ideals. J. Comb. Theory, Ser. B 12 (1972), 163–168.
G. A. Dirac: Some theorems on abstract graphs. Proc. Lond. Math. Soc., III. Ser. 2 (1952), 69–81.
P. Erdős: Remarks on a paper of Pósa. Publ. Math. Inst. Hung. Acad. Sci., Ser. A 7 (1962), 227–229.
Y.-Z. Fan, G.-D. Yu: Spectral condition for a graph to be Hamiltonian with respect to normalized Laplacian. Preprint available at Arxiv 1207.6824v1 (2012), 12 pages.
M. Fiedler, V. Nikiforov: Spectral radius and Hamiltonicity of graphs. Linear Algebra Appl. 432 (2010), 2170–2173.
Y. Hong, J.-L. Shu, K. Fang: A sharp upper bound of the spectral radius of graphs. J. Comb. Theory, Ser. B 81 (2001), 177–183.
M. Krivelevich, B. Sudakov: Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42 (2003), 17–33.
R. Li: Laplacian spectral radius and some Hamiltonian properties of graphs. Appl. Math. E-Notes (electronic only) 14 (2014), 216–220; corrigendum, ibid. 15 (2015), 216–217.
B. Li, B. Ning: Spectral analogues of Erdős’ and Moon-Moser’s theorems on Hamilton cycles. Linear Multilinear Algebra. DOI:10.1080/03081087.2016.1151854.
R. Liu, W. C. Shiu, J. Xue: Sufficient spectral conditions on Hamiltonian and traceable graphs. Linear Algebra Appl. 467 (2015), 254–266.
M. Lu, H. Liu, F. Tian: Spectral radius and Hamiltonian graphs. Linear Algebra Appl. 437 (2012), 1670–1674.
V. Nikiforov: Some inequalities for the largest eigenvalue of a graph. Comb. Probab. Comput. 11 (2002), 179–189.
B. Ning, J. Ge: Spectral radius and Hamiltonian properties of graphs. Linear Multilinear Algebra 63 (2015), 1520–1530.
O. Ore: Hamilton connected graphs. J. Math. Pures Appl., IX. Sér. 42 (1963), 21–27.
O. Ore: Arc coverings of graphs. Ann. Mat. Pura Appl., IV. Ser. 55 (1961), 315–321.
B. Zhou: Signless Laplacian spectral radius and Hamiltonicity. Linear Algebra Appl. 432 (2010), 566–570.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Miroslav Fiedler
Rights and permissions
About this article
Cite this article
Nikiforov, V. Spectral radius and Hamiltonicity of graphs with large minimum degree. Czech Math J 66, 925–940 (2016). https://doi.org/10.1007/s10587-016-0301-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-016-0301-y