A spectral extremal problem on non-bipartite triangle-free graphs
From MaRDI portal
Publication:6194251
DOI10.37236/12009arXiv2304.00716OpenAlexW4392590021MaRDI QIDQ6194251
Yue Jian Peng, Yongtao Li, Li-Hua Feng
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/2304.00716
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- More spectral bounds on the clique and independence numbers
- A bound on the spectral radius of graphs
- Large dense neighbourhoods and Turán's theorem
- Dense neighbourhoods and Turan's theorem
- The spectral radius of trees on \(k\) pendant vertices
- A sharp upper bound of the spectral radius of graphs
- Many cliques with few edges and bounded maximum degree
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Equiangular lines with a fixed angle
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
- A unique characterization of spectral extrema for friendship graphs
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
- The maximum spectral radius of graphs without friendship subgraphs
- 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
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Three conjectures in extremal spectral graph theory
- Bounds on graph eigenvalues. II
- On the eigenvalues of trees
- Cliques and the spectral radius
- 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
- Counting substructures and eigenvalues. I: Triangles
- Some new results in extremal graph theory
- Some Inequalities for the Largest Eigenvalue of a Graph
- Eigenvalues and triangles in graphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Matrix theory. Basic results and techniques
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- Spectral extremal graphs for the bowtie
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- A complete solution to the Cvetković–Rowlinson conjecture
- Refinement on Spectral Turán’s Theorem
- Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles
- Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs
This page was built for publication: A spectral extremal problem on non-bipartite triangle-free graphs
