Abstract
Let G be a simple graph with n vertices, m edges and minimum degree . In this paper, we prove that ifthen G is Hamiltonian with only a few exceptions. Using this result, we present some spectral sufficient conditions for a graph to be Hamiltonian in terms of the spectral radius or signless Laplacian spectral radius of the graph. Our results improve some previous work.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
