Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
Qiannan Zhou, Ligong Wang, Yong Lu
TL;DR
This paper establishes spectral conditions based on the signless Laplacian spectral radius that guarantee a graph is Hamilton-connected, improving upon previous spectral criteria.
Contribution
It introduces new spectral sufficient conditions for Hamilton-connectedness using the signless Laplacian spectral radius, enhancing existing results.
Findings
Spectral conditions guarantee Hamilton-connectedness.
Improved bounds over previous spectral criteria.
Results applicable to a wide class of graphs.
Abstract
In this paper, we present some spectral sufficient conditions for a graph to be Hamilton-connected in terms of the spectral radius or signless Laplacian spectral radius of the graph. Our results improve some previous work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Magnetism in coordination complexes