Spectral radius and Hamiltonian properties of graphs
From MaRDI portal
Publication:4981977
DOI10.1080/03081087.2014.947984zbMath1332.05091arXiv1309.0217OpenAlexW1972597319MaRDI QIDQ4981977
Publication date: 23 March 2015
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0217
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 (40)
Laplacian spread and some Hamiltonian properties of graphs ⋮ An improvement of spectral conditions for Hamilton-connected graphs ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ The largest eigenvalue conditions for Hamiltonian and traceable graphs ⋮ Unnamed Item ⋮ The first zagreb index and some hamiltonian properties of the line graph of a graph ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ Unnamed Item ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ Spectral radius and spanning trees of graphs ⋮ Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ Some sufficient spectral conditions on Hamilton-connected and traceable graphs ⋮ Distance signless Laplacian spectral radius and Hamiltonian properties of graphs ⋮ Toughness, Hamiltonicity and spectral radius in graphs ⋮ WIENER INDEX ON TRACEABLE AND HAMILTONIAN GRAPHS ⋮ Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ 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 ⋮ Spectral conditions for some graphical properties ⋮ Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree ⋮ Spectral radius and Hamiltonicity of graphs ⋮ 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 ⋮ 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 ⋮ Spectral radius and Hamiltonicity of graphs with large minimum degree ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles ⋮ Wiener-type invariants and Hamiltonian properties of graphs ⋮ Spectral condition for Hamiltonicity of a graph
Cites Work
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectral radius and Hamiltonian graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Cycles in 2-connected graphs
- Arc coverings of graphs
- The spectral radius of graphs without paths and cycles of specified length
- More spectral bounds on the clique and independence numbers
- Signless Laplacian spectral radius and Hamiltonicity
- A domain monotonicity theorem for graphs and Hamiltonicity
- Bounds of eigenvalues of graphs
- A sharp upper bound of the spectral radius of graphs
- Hamilton cycles and eigenvalues of graphs
- Revisit of Erdős-Gallai's theorem on the circumference of a graph
- On Hamilton's ideals
- Some Inequalities for the Largest Eigenvalue of a Graph
- On maximal paths and circuits of graphs
- Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Maximal circuits of graphs. I
- Sparse pseudo‐random graphs are Hamiltonian
- Sufficient Conditions for Circuits in Graphs†
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: Spectral radius and Hamiltonian properties of graphs
