Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs

DOI10.1016/J.LAA.2023.11.015zbMath1530.05119arXiv2305.18130OpenAlexW4388818369MaRDI QIDQ6185990

Xi-Ying Yuan, Yanni Zhai

Publication date: 9 January 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

spectral radiusadjacency matrixextremal graphlinear forest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Spectral radius of graphs with given matching number
• The spectral radius of graphs without paths and cycles of specified length
• Spectral extremal results with forbidding linear forests
• The spectral radius of graphs without long cycles
• The formula for Turán number of spanning linear forests
• The maximum spectral radius of graphs without friendship subgraphs
• The spectral radius of graphs with no odd wheels
• Spectral extrema for graphs: the Zarankiewicz problem
• Bounds on graph eigenvalues. II
• On a conjecture of spectral extremal problems
• Spectral extremal graphs for disjoint cliques
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Spectral extrema of graphs with bounded clique number and matching number
• A Spectral Erdős-Sós Theorem

This page was built for publication: Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs