Eigenvalues and cycles of consecutive lengths

DOI10.1002/jgt.22930zbMath1522.05279arXiv2110.05670OpenAlexW4316039737MaRDI QIDQ6074592

Bin Long Li, Bo Ning

Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.05670

zbMATH Keywords

spectral radiuscyclesRamsey theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Ramsey theory (05D10)

Related Items (3)

The spectral radius, maximum average degree and cycles of consecutive lengths of graphs ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• Bounds of eigenvalues of graphs
• A note on cycle lengths in graphs
• A conjecture on the spectral radius of graphs
• Sharp upper bounds of the spectral radius of a graph
• A spectral condition for odd cycles in graphs
• Pancyclic graphs. I
• A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs

This page was built for publication: Eigenvalues and cycles of consecutive lengths