Spectral extrema of graphs with fixed size: forbidden triangles and pentagons
From MaRDI portal
Publication:6589128
DOI10.1016/j.disc.2024.114151MaRDI QIDQ6589128
Publication date: 19 August 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectral extrema of graphs: forbidden hexagon
- A contribution to the Zarankiewicz problem
- The spectral radius of graphs without paths and cycles of specified length
- 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 bounds for the clique and independence numbers of graphs
- Problems in algebraic combinatorics
- Vraagstuk XXVIII.
- The spectral radius of trees on \(k\) pendant vertices
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- On the Turán number of theta graphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
- The maximum spectral radius of graphs without friendship subgraphs
- A spectral version of Mantel's theorem
- Adjacency eigenvalues of graphs without short odd cycles
- The spectral radius of graphs with no odd wheels
- Spectral extrema for graphs: the Zarankiewicz problem
- Bounds on graph eigenvalues. II
- A spectral condition for odd cycles in graphs
- 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
- A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
- 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
- Extremal Numbers for Odd Cycles
- The History of Degenerate (Bipartite) Extremal Graph Problems
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- Spectral radius of graphs of given size with forbidden subgraphs
- A spectral extremal problem on non-bipartite triangle-free graphs
- Spectral radius of graphs with given size and odd girth
- A survey on spectral conditions for some extremal graph problems
This page was built for publication: Spectral extrema of graphs with fixed size: forbidden triangles and pentagons