Spectral extrema of graphs with fixed size: forbidden triangles and pentagons
From MaRDI portal
Publication:6589128
DOI10.1016/J.DISC.2024.114151MaRDI QIDQ6589128FDOQ6589128
Authors: Shuchao Li, Yuantian Yu 
Publication date: 19 August 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Spectral extremal problem on \(t\) copies of \(\ell\)-cycles
- Some new results and problems in spectral extremal graph theory
- A spectral extremal problem on non-bipartite triangle-free graphs
Cites Work
- Title not available (Why is that?)
- Graph theory
- Title not available (Why is that?)
- More spectral bounds on the clique and independence numbers
- Some Inequalities for the Largest Eigenvalue of a Graph
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- The spectral radius of graphs without paths and cycles of specified length
- An introduction to the theory of graph spectra
- The history of degenerate (bipartite) extremal graph problems
- On the spectral radius of (0,1)-matrices
- Problems in algebraic combinatorics
- Title not available (Why is that?)
- The spectral radius of trees on \(k\) pendant vertices
- Bounds on graph eigenvalues. II
- Some new results in extremal graph theory
- A contribution to the Zarankiewicz problem
- A spectral condition for odd cycles in graphs
- Cliques and the spectral radius
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- On the Turán number of theta graphs
- Extremal numbers for odd cycles
- Spectral extrema of graphs: forbidden hexagon
- A spectral version of Mantel's theorem
- Vraagstuk XXVIII.
- The maximum spectral radius of graphs without friendship subgraphs
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- 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
- Eigenvalues and triangles in graphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Adjacency eigenvalues of graphs without short odd cycles
- The spectral radius of graphs with no odd wheels
- Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
- Counting substructures and eigenvalues. I: Triangles
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
- 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
Cited In (4)
This page was built for publication: Spectral extrema of graphs with fixed size: forbidden triangles and pentagons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589128)
