Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

DOI10.1080/03081087.2017.1383346zbMath1395.05102arXiv1710.08641OpenAlexW3105962067MaRDI QIDQ5375918

Xing Peng, Yao Liu, Yawen Li

Publication date: 17 September 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.08641

zbMATH Keywords

eigenvalueHamiltonian cyclesignless Laplacian matrix

Mathematics Subject Classification ID

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

Related Items (8)

Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ Bounds on signless Laplacian eigenvalues of Hamiltonian graphs ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree

Cites Work

• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Signless Laplacian spectral radius and Hamiltonicity
• Spectral radius and Hamiltonicity of graphs with large minimum degree
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Spectral radius and Hamiltonian properties of graphs
• Reducibility among Combinatorial Problems
• Some Theorems on Abstract Graphs
• Spectral radius and Hamiltonicity of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree