Spectral analogues of Erdős' theorem on Hamilton-connected graphs

DOI10.1016/J.AMC.2018.08.005MaRDI QIDQ2007677zbMATH OpenOpenAlexFDO

Authors Jia Wei, Zhifu You, Hong-Jian Lai

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

zbMATH Keywords

minimum degreespectral radiusHamilton-connected

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

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

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• A method in graph theory
• A sharp upper bound of the spectral radius of graphs
• Arc coverings of graphs
• Graph theory
• Hamilton connected graphs
• On a conjecture of V. Nikiforov
• On graphs with randomly deleted edges
• On maximal paths and circuits of graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• Some Theorems on Abstract Graphs
• Spectral radius and Hamiltonicity of graphs with large minimum degree.
• The number of edges, spectral radius and Hamilton-connectedness of graphs

Cited in

(13)

• An improvement of spectral conditions for Hamilton-connected graphs
• The number of edges, spectral radius and Hamilton-connectedness of graphs
• Hamilton-connectivity of line graphs with application to their detour index
• Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
• An \(A_\alpha\)-spectral Erdős-Pósa theorem
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
• Improved sufficient conditions for \(k\)-leaf-connected graphs
• Generalizations of the classics to spanning connectedness
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• An improvement of sufficient condition for \(k\)-leaf-connected graphs
• Spectral and extremal conditions for supereulerian graphs
• Spectral results on Hamiltonian problem

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)