Distance signless Laplacian spectral radius and Hamiltonian properties of graphs

DOI10.1080/03081087.2016.1273314zbMath1387.05161arXiv1610.06979OpenAlexW2543210851MaRDI QIDQ4603759

Qiannan Zhou, Li-Gong Wang

Publication date: 19 February 2018

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

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

zbMATH Keywords

distance signless Laplacian spectral radiusHamilton-connected graphtraceablility from every vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (11)

Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ Wiener-type invariants and \(k\)-leaf-connected graphs ⋮ Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius ⋮ Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree ⋮ Some sufficient conditions on \(k\)-connected graphs ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ Bounds on signless Laplacian eigenvalues of Hamiltonian graphs ⋮ Matching number, connectivity and eigenvalues of distance signless Laplacians ⋮ Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected 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

• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Characterizing degree-sum maximal nonhamiltonian bipartite graphs
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Signless Laplacian spectral radius and Hamiltonicity
• Advances on the Hamiltonian problem -- a survey
• Recent advances on the Hamiltonian problem: survey III
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• On the distance signless Laplacian spectral radius of graphs
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Sparse pseudo‐random graphs are Hamiltonian
• Spectral radius and Hamiltonian properties of graphs
• Reducibility among Combinatorial Problems
• Spectral radius and Hamiltonicity of graphs
• Unnamed Item

This page was built for publication: Distance signless Laplacian spectral radius and Hamiltonian properties of graphs