Spectral sufficient conditions on traceable graphs

DOI10.15960/J.CNKI.ISSN.1007-6093.2017.01.012MaRDI QIDQ5371807zbMATH OpenFDO

Authors Guidong Yu, Fu Zhou, Qi Liu

Publication date 20 October 2017

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2017.01.012

zbMATH Keywords

distance signless Laplacian spectral radiussignless Laplacian spectral radiusspectral radius

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• scientific article; zbMATH DE number 6831911
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Sufficient conditions for a graph to be Hamilton-connected and traceable from every vertex
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Spectral radius and Hamiltonicity of graphs

Cited in

(6)

• Sufficient conditions for a graph to be Hamilton-connected and traceable from every vertex
• Spectral conditions for traceability of connected claw-free graphs
• Spectral radius and traceability of graphs with large minimum degree
• Spectral radius and traceability of connected claw-free graphs
• Spectral sufficient conditions of the existence of the longest path in the graph and its traceability
• On the normalized Laplacian spectral radius of traceable graphs

This page was built for publication: Spectral sufficient conditions on traceable graphs

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