The spectral radius, maximum average degree and cycles of consecutive lengths of graphs

DOI10.1007/s00373-024-02761-0OpenAlexW4392456018MaRDI QIDQ6121917

Wenqian Zhang

Publication date: 26 March 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-024-02761-0

zbMATH Keywords

spectral radiuscycles of consecutive lengthsspectral extrema

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) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposing a graph into pseudoforests with one having bounded degree
• Spectra of graphs
• On the maximal index of graphs with a prescribed number of edges
• On the maximal index of connected graphs
• A sharp upper bound of the spectral radius of graphs
• A note on cycle lengths in graphs
• Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
• A conjecture on the spectral radius of graphs
• The pseudoforest analogue for the strong nine dragon tree conjecture is true
• Bounds on graph eigenvalues. II
• A spectral condition for odd cycles in graphs
• On the degrees of the vertices of a directed graph
• 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
• Eigenvalues and cycles of consecutive lengths

This page was built for publication: The spectral radius, maximum average degree and cycles of consecutive lengths of graphs