On sufficient spectral radius conditions for Hamiltonicity of k-connected graphs

DOI10.1016/J.LAA.2020.06.012MaRDI QIDQ2197203zbMATH OpenOpenAlexFDO

Authors Qiannan Zhou, Ligong Wang, Yong Lu, Hajo Broersma

Publication date 28 August 2020

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.laa.2020.06.012

zbMATH Keywords

spectral radiusHamiltoniantraceable\(k\)-connected

Mathematics Subject Classification ID

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

Recommendations

• Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
• Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
• Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
• Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
• scientific article; zbMATH DE number 6401583
• Sufficient conditions for some Hamiltonian properties and \(k\)-connectivity of graphs
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• scientific article; zbMATH DE number 6793075
• Spectral radius and Hamiltonicity of graphs
• Spectral radius and Hamiltonicity of graphs

Cites work

• scientific article; zbMATH DE number 6949373 (Why is no real title available?)
• A method in graph theory
• A note on Hamiltonian circuits
• A sharp upper bound of the spectral radius of graphs
• Chromatic number and the 2-rank of a graph
• Graph theory
• Signless Laplacian spectral radius and Hamiltonicity
• Some Inequalities for the Largest Eigenvalue of a Graph
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral condition for Hamiltonicity of a graph
• Spectral radius and Hamiltonian graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs
• Spectral radius and Hamiltonicity of graphs with large minimum degree.
• Sufficient spectral conditions on Hamiltonian and traceable graphs

Cited in

(13)

• Spectral analogues of Erdős' theorem on Hamilton-connected graphs
• On the normalized Laplacian spectral radius of traceable graphs
• scientific article; zbMATH DE number 6401583 (Why is no real title available?)
• Spectral radius and Hamiltonicity of graphs with large minimum degree.
• Sufficient conditions for a graph to be Hamilton-connected and traceable from every vertex
• Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
• Distance spectral radius and Hamiltonicity of a graph
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
• scientific article; zbMATH DE number 6831911 (Why is no real title available?)
• The spectral radius and \(k\)-power of Hamilton cycle of graphs

This page was built for publication: On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197203)