Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius

DOI10.1080/03081087.2017.1331994zbMath1391.05161OpenAlexW2962744814MaRDI QIDQ4643700

Xiaodan Chen, Jian Guo Qian, Yao-Ping Hou

Publication date: 28 May 2018

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

Full work available at URL: https://doi.org/10.1080/03081087.2017.1331994

zbMATH Keywords

spectral radiusHamiltonian graphsufficient conditionsignless Laplaciannumber of edges

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree ⋮ Bounds on signless Laplacian eigenvalues of Hamiltonian graphs ⋮ Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral condition for Hamiltonicity of a graph
• Spectral radius and Hamiltonian graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Arc coverings of graphs
• Hamilton connected graphs
• Signless Laplacian spectral radius and Hamiltonicity
• A method in graph theory
• A sharp upper bound of the spectral radius of graphs
• Maximizing the sum of the squares of the degrees of a graph
• Recent advances on the Hamiltonian problem: survey III
• On Hamilton's ideals
• Spectral radius and Hamiltonicity of graphs with large minimum degree
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Some new results in extremal graph theory
• Some Inequalities for the Largest Eigenvalue of a Graph
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
• Sparse pseudo‐random graphs are Hamiltonian
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and traceability of connected claw-free graphs
• Variations on the Hamiltonian Theme
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius