A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
From MaRDI portal
Publication:2699932
DOI10.1016/j.disc.2023.113365OpenAlexW4319869481MaRDI QIDQ2699932
Publication date: 20 April 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.11345
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (3)
Eigenvalues and cycles of consecutive lengths ⋮ Refinement on Spectral Turán’s Theorem ⋮ The spectral radius, maximum average degree and cycles of consecutive lengths of graphs
Cites Work
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectral extrema of graphs: forbidden hexagon
- A contribution to the Zarankiewicz problem
- The spectral radius of graphs without paths and cycles of specified length
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- Spectral bounds for the clique and independence numbers of graphs
- Bounds of eigenvalues of graphs
- The spectral radius of graphs without long cycles
- A spectral condition for the existence of a pentagon in non-bipartite graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Bounds on graph eigenvalues. II
- A spectral condition for odd cycles in graphs
- Some new results in extremal graph theory
- Eigenvalues and triangles in graphs
- Spectral radius and Hamiltonian properties of graphs, II
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- Cycle lengths in graphs with large minimum degree
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- Eigenvalues and cycles of consecutive lengths
This page was built for publication: A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs