Spectral analogues of Erdős' theorem on Hamilton-connected graphs
From MaRDI portal
Publication:2007677
DOI10.1016/J.AMC.2018.08.005zbMATH Open1428.05206OpenAlexW2890665878MaRDI QIDQ2007677FDOQ2007677
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
Recommendations
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- An improvement of spectral conditions for Hamilton-connected graphs
- Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Graph theory
- On a conjecture of V. Nikiforov
- A sharp upper bound of the spectral radius of graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- On graphs with randomly deleted edges
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- A method in graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Arc coverings of graphs
- Hamilton connected graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- The number of edges, spectral radius and Hamilton-connectedness of graphs
Cited In (8)
- Spectral results on Hamiltonian problem
- An \(A_\alpha\)-spectral Erdős-Pósa theorem
- Improved sufficient conditions for \(k\)-leaf-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 spectral conditions for Hamilton-connected graphs
- An improvement of sufficient condition for \(k\)-leaf-connected graphs
- Spectral and extremal conditions for supereulerian graphs
This page was built for publication: Spectral analogues of Erdős' theorem on Hamilton-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007677)
