Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian

References

• Bapat RB. Graphs and matrices. 2nd ed. New York (NY): Springer; 2014. (UTX).
   Google Scholar
• Brouwer AE, Haemers WH. Spectra of graphs. New York (NY): Springer; 2012. (UTX).
   Google Scholar
• Godsil C, Royle G. Algebraic graph theory. New York (NY): Springer; 2001. (GTM; 207).
   Google Scholar
• Dirac DA. Some theorems on abstract graphs. Proc London Math Soc. 1952;2:69–81.
   Google Scholar
• Ore O. Arc coverings of graphs. Ann Mat Pura Appl IV Ser. 1961;55:315–321.
   Google Scholar
• Bondy JA. Variations on the Hamiltonian theme. Can Math Bull. 1972;15:57–62.
   Web of Science ®Google Scholar
• Bondy JA, Murty USR. Graph theory with applications. Amsterdam: North-Holland; 1976.
   Google Scholar
• Erd "os P. Remarks on a paper of Pósa. Publ Math Inst Hung Acad Sci Ser A. 1962;7:227–229.
   Google Scholar
• Fiedler M, Nikiforov V. Spectral radius and Hamiltonicity of graphs. Linear Algebra Appl. 2010;432:2170–2173.
   Web of Science ®Google Scholar
• Yu G, Fan Y. Spectral conditions for a graph to be Hamilton-connected. Appl Mech Mater. 2013;336:2329–2334.
   Google Scholar
• Liu R, Shiu WC, Xue J. Sufficient spectral conditions on Hamiltonian and traceable graphs. Linear Algebra Appl. 2015;467:254–266.
   Web of Science ®Google Scholar
• Li B, Ning B. Spectral analogues of Erd "os' and Moon–Moser's theorems on Hamilton cycles. Linear Multilinear Algebra. 2016;64:2252–2269.
   Web of Science ®Google Scholar
• Nikiforov V. Spectral radius and Hamiltonicity of graphs with large minimum degree. Czechoslov Math J. 2016;66(141):925–940.
   Web of Science ®Google Scholar
• Kelmans AK. On graphs with randomly deleted edges. Acta Math Acad Sci Hungar. 1981;37:77–88.
   Web of Science ®Google Scholar
• Csikvári P. On a conjecture of V. Nikiforov. Discrete Math. 2009;309(13):4522–4526.
   Web of Science ®Google Scholar
• Wu B, Xiao E, Hong Y. The spectral radius of the trees on k pendant vertices. Linear Algebra Appl. 2005;395:343–349.
   Web of Science ®Google Scholar
• Li Y, Liu Y, Peng X. Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree. Linear Multilinear Algebra. 2018;66:2011–2023.
   Web of Science ®Google Scholar
• Füredi Z, Kostochka A, Luo R. A stability version for a theorem of Erd "os on non-Hamiltonian graphs. Discrete Math. 2017;340:2688–2690.
   Web of Science ®Google Scholar
• Füredi Z, Kostochka A, Luo R. A variation of a theorem by Pósa. Discrete Math. 2019;342:1919–1923.
   Web of Science ®Google Scholar
• Chartrand G, Kapoor S, Lick D. n-Hamiltonian graphs. J Combin Theory. 1970;9:308–312.
   Google Scholar
• Chvátal V. On Hamilton's ideals. J Combin Theory Ser B. 1972;12:163–168.
   Google Scholar
• Liu WJ, Liu M, Zhang P, et al. Spectral conditions for graphs to be k-Hamiltonian or k-path-coverable. Discuss Math Graph Theory. 2020;40:161–179.
   Web of Science ®Google Scholar
• Liu M, Lai HJ, Das KC. Spectral results on Hamiltonian problem. Discrete Math. 2019;342:1718–1730.
   Web of Science ®Google Scholar
• Hong Y, Shu JL, Fang K. A sharp upper bound of the spectral radius of graphs. J Combin Theory Ser B. 2001;81:177–183.
   Web of Science ®Google Scholar
• Nikiforov V. Some inequalities for the largest eigenvalue of a graph. Combin Probab Comput. 2002;11:179–189.
   Web of Science ®Google Scholar
• Zhou B, Cho HH. Remarks on spectral radius and Laplacian eigenvalues of a graph. Czechoslov Math J. 2005;55(130):781–790.
   Google Scholar
• Feng LH, Yu GH. On three conjectures involving the signless Laplacian spectral radius of graphs. Publ Inst Math (Beograd). 2009;85:35–38.
   Google Scholar
• Hong Y, Zhang XD. Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrix of trees. Discrete Math. 2005;296:187–197.
   Web of Science ®Google Scholar
• Bondy JA, Chvátal V. A method in graph theory. Discrete Math. 1976;15:111–135.
   Web of Science ®Google Scholar
• Kronk HV. Generalization of a theorem of Pósa. Proc Am Math Soc. 1969;21:77–78.
   Web of Science ®Google Scholar
• Moon J, Moser L. On Hamiltonian bipartite graphs. Israel J Math. 1963;1(3):163–165.
   Web of Science ®Google Scholar
• Li B, Ning B. Spectral analogues of Moon–Moser's theorem on Hamilton paths in bipartite graphs. Linear Algebra Appl. 2017;515:180–195.
   Web of Science ®Google Scholar
• Ning B, Ge J. Spectral radius and Hamiltonian properties of graphs. Linear Multilinear Algebra. 2015;63:1520–1530.
   Web of Science ®Google Scholar
• Ge J, Ning B. Spectral radius and Hamiltonian properties of graphs II. Linear Multilinear Algebra. 2020;68:2298–2315.
   Web of Science ®Google Scholar
• Jiang GS, Yu GD, Fang Y. Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree. Appl Math Comput. 2019;356:137–143.
   Web of Science ®Google Scholar
• Liu M, Wu Y, Lai HJ. Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs. Graphs Combin. 2020;36:1363–1390.
   Web of Science ®Google Scholar
• Lu Y. Some generalizations of spectral conditions for 2s-Hamiltonicity and 2s-traceability of bipartite graphs. Linear and Multilinear Algebra. 2020. doi:10.1080/03081087.2020.1778621
   Web of Science ®Google Scholar