Spectral radius and Hamiltonian properties of graphs, II
From MaRDI portal
Publication:5133410
DOI10.1080/03081087.2019.1580668zbMath1452.05104arXiv1606.08530OpenAlexW3043838817WikidataQ114641279 ScholiaQ114641279MaRDI QIDQ5133410
Publication date: 13 November 2020
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.08530
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 (6)
Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On the first eigenvalue of bipartite graphs
- On a conjecture of V. Nikiforov
- Signless Laplacian spectral radius and Hamiltonicity
- Bounds of eigenvalues of graphs
- Extremal problems on the Hamiltonicity of claw-free graphs
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- A sharp upper bound of the spectral radius of graphs
- Pancyclic graphs. I
- Large cycles in graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- On three conjectures involving the signless Laplacian spectral radius of graphs
- On graphs with randomly deleted edges
- Maximal circuits of graphs. I
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and traceability of connected claw-free graphs
- Sufficient Conditions for Circuits in Graphs†
- Variations on the Hamiltonian Theme
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: Spectral radius and Hamiltonian properties of graphs, II