On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
From MaRDI portal
Publication:2197203
DOI10.1016/J.LAA.2020.06.012zbMath1446.05064OpenAlexW3036047107MaRDI QIDQ2197203
Yong Lu, Qiannan Zhou, Li-Gong Wang, Hajo J. Broersma
Publication date: 28 August 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.06.012
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral condition for Hamiltonicity of a graph
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Signless Laplacian spectral radius and Hamiltonicity
- A method in graph theory
- Chromatic number and the 2-rank of a graph
- A sharp upper bound of the spectral radius of graphs
- A note on Hamiltonian circuits
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs