Spectral condition for Hamiltonicity of a graph

DOI10.1016/j.laa.2016.01.005zbMath1331.05125OpenAlexW2274396795MaRDI QIDQ252603

Vladimir I. Benediktovich

Publication date: 3 March 2016

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

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

zbMATH Keywords

spectral radiusHamiltonian cycleminimum degreeHamiltonian path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (17)

An improvement of spectral conditions for Hamilton-connected graphs ⋮ The largest eigenvalue conditions for Hamiltonian and traceable graphs ⋮ Unnamed Item ⋮ Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ Toughness, Hamiltonicity and spectral radius in 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 ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs ⋮ 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 ⋮ Spectral radius and Hamiltonicity of graphs with large minimum degree ⋮ Spectral and extremal conditions for supereulerian graphs

Cites Work

• Unnamed Item
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Spectral radius and Hamiltonian graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• The spectral radius of graphs without paths and cycles of specified length
• On a conjecture of V. Nikiforov
• More spectral bounds on the clique and independence numbers
• Signless Laplacian spectral radius and Hamiltonicity
• A domain monotonicity theorem for graphs and Hamiltonicity
• Chromatic number and the 2-rank of a graph
• A sharp upper bound of the spectral radius of graphs
• Hamilton cycles and eigenvalues of graphs
• On Hamilton's ideals
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• Some Inequalities for the Largest Eigenvalue of a Graph
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• On graphs with randomly deleted edges
• Sparse pseudo‐random graphs are Hamiltonian
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Spectral condition for Hamiltonicity of a graph