Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \)
From MaRDI portal
Publication:6184551
DOI10.1016/J.DISC.2023.113781arXiv2209.11947OpenAlexW4388545236MaRDI QIDQ6184551
Publication date: 25 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.11947
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Characterization of \(P_{6}\)-free graphs
- Connected graphs without long paths
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- More spectral bounds on the clique and independence numbers
- On the spectral radius of (0,1)-matrices
- 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
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
- Some Inequalities for the Largest Eigenvalue of a Graph
This page was built for publication: Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \)
