Spectral radius of graphs with given size and odd girth

DOI10.37236/11720arXiv2207.12689OpenAlexW4392599223MaRDI QIDQ6194258

Xueyi Huang, Lu Lu, Zhenzhen Lou

Publication date: 19 March 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

trianglespectral radiusquadrilateralMantel's theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• More spectral bounds on the clique and independence numbers
• The spectral radius of trees on \(k\) pendant vertices
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
• Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
• A spectral version of Mantel's theorem
• Adjacency eigenvalues of graphs without short odd cycles
• A spectral condition for odd cycles in non-bipartite graphs
• Bounds on graph eigenvalues. II
• A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
• The maximum spectral radius of graphs of given size with forbidden subgraph
• Some new results in extremal graph theory
• Some Inequalities for the Largest Eigenvalue of a Graph
• Eigenvalues and triangles in graphs
• Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
• Refinement on Spectral Turán’s Theorem

This page was built for publication: Spectral radius of graphs with given size and odd girth