Spectral analogues of Erdős' theorem on Hamilton-connected graphs
From MaRDI portal
Publication:2007677
DOI10.1016/j.amc.2018.08.005zbMath1428.05206OpenAlexW2890665878MaRDI QIDQ2007677
Zhifu You, Hong-Jian Lai, Jia Wei
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.08.005
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)
Related Items (7)
Improved sufficient conditions for \(k\)-leaf-connected graphs ⋮ An improvement of spectral conditions for Hamilton-connected graphs ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ An improvement of sufficient condition for \(k\)-leaf-connected graphs ⋮ Spectral results on Hamiltonian problem ⋮ Spectral and extremal conditions for supereulerian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc coverings of graphs
- Hamilton connected graphs
- On a conjecture of V. Nikiforov
- A method in graph theory
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- A sharp upper bound of the spectral radius of graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Some Inequalities for the Largest Eigenvalue of a Graph
- On maximal paths and circuits of graphs
- On graphs with randomly deleted edges
- Some Theorems on Abstract Graphs
This page was built for publication: Spectral analogues of Erdős' theorem on Hamilton-connected graphs