Sufficient spectral conditions on Hamiltonian and traceable graphs
Ruifang Liu, Wai Chee Shiu, Jie Xue
TL;DR
This paper establishes new spectral radius conditions for bipartite graphs to be Hamiltonian or traceable, and improves existing bounds using signless Laplacian spectral radius criteria.
Contribution
It provides expanded and tighter spectral conditions for Hamiltonian and traceable graphs, advancing spectral graph theory results.
Findings
Spectral radius conditions for bipartite Hamiltonian graphs
Signless Laplacian spectral radius bounds for traceability
Improved criteria over previous studies
Abstract
In this paper, we give sufficient conditions on the spectral radius for a bipartite graph to Hamiltonian and traceable, which expand the results of Lu, Liu and Tian (2012) [10]. Furthermore, we also present tight sufficient conditions on the signless Laplacian spectral radius for a graph to Hamiltonian and traceable, which improve the results of Yu and Fan (2012) [12].
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 · Spectral Theory in Mathematical Physics · Matrix Theory and Algorithms