Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
From MaRDI portal
Publication:2953184
DOI10.1080/03081087.2016.1151854zbMath1352.05105arXiv1504.03556OpenAlexW1973702871MaRDI QIDQ2953184
Publication date: 3 January 2017
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.03556
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Eulerian and Hamiltonian graphs (05C45)
Related Items (35)
Some spectral sufficient conditions for a graph being pancyclic ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ 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 ⋮ The formula for Turán number of spanning linear forests ⋮ Spectral radius and spanning trees of graphs ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ Non-Hamiltonian graphs with large minimum degree ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ Toughness, Hamiltonicity and spectral radius in graphs ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs ⋮ Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs ⋮ Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs ⋮ Spectral conditions for some graphical properties ⋮ Spectral results on Hamiltonian problem ⋮ Maximizing the number of cliques in graphs with given matching number ⋮ Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree ⋮ Spectral radius and Hamiltonicity of graphs ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ Spectral radius and traceability of 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 ⋮ Eigenvalues and triangles in graphs ⋮ Fractional matching number and eigenvalues of a graph ⋮ Stability results on the circumference of a graph ⋮ Spectral radius and the 2-power of Hamilton cycle ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree ⋮ Spectral and extremal conditions for supereulerian graphs ⋮ Spectral condition for Hamiltonicity of a graph
Cites Work
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Spectra of graphs
- Characterizing degree-sum maximal nonhamiltonian bipartite graphs
- Arc coverings of graphs
- On a conjecture of V. Nikiforov
- Signless Laplacian spectral radius and Hamiltonicity
- A note on Laplacian graph eigenvalues
- A method in graph theory
- The spectral radius of trees on \(k\) pendant vertices
- On the spectral radius of graphs with cut vertices
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- On Hamiltonian bipartite graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Eigenvalues of the Laplacian of a graph∗
- Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
- On graphs with randomly deleted edges
- The Signless Laplacian Spectral Radius for Bicyclic Graphs with κ Pendant Vertices
- Spectral radius and Hamiltonian properties of graphs
- Some Theorems on Abstract Graphs
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
