Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
From MaRDI portal
Publication:2053709
DOI10.1007/s00373-021-02369-8zbMath1479.05184OpenAlexW3183551808MaRDI QIDQ2053709
Qiannan Zhou, Li-Gong Wang, Yong Lu, Hajo J. Broersma
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02369-8
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cites Work
- Unnamed Item
- Spectral condition for Hamiltonicity of a graph
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Spectra of graphs
- On a conjecture of V. Nikiforov
- A method in graph theory
- Advances on the Hamiltonian problem -- a survey
- Chromatic number and the 2-rank of a graph
- A sharp upper bound of the spectral radius of graphs
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Recent advances on the Hamiltonian problem: survey III
- On Hamilton's ideals
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- On graphs with randomly deleted edges
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs