Spectral extremal graphs for the bowtie
From MaRDI portal
Publication:6056745
DOI10.1016/j.disc.2023.113680zbMath1522.05231arXiv2212.05739OpenAlexW4386620507MaRDI QIDQ6056745
Yue Jian Peng, Lu Lu, Yongtao Li
Publication date: 4 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.05739
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Extremal problems for the \(p\)-spectral radius of graphs
- Walks and the spectral radius of graphs
- Spectral saturation: inverting the spectral Turán theorem
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- Spectral bounds for the clique and independence numbers of graphs
- Extremal graphs for intersecting cliques
- Extremal graphs for intersecting triangles
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Maxima of the \(Q\)-index: forbidden a Fan
- Spectral extremal graphs for intersecting cliques
- The spectral radius of graphs with no intersecting odd cycles
- A unique characterization of spectral extrema for friendship graphs
- 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
- Analytic methods for uniform hypergraphs
- Maxima of the \(Q\)-index: forbidden odd cycles
- Maxima of the \(Q\)-index: forbidden even cycles
- Turán's theorem for the Fano plane
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- The Turán number of the Fano plane
- Three conjectures in extremal spectral graph theory
- Bowtie-free graphs have a Ramsey lift
- Bounds on graph eigenvalues. II
- Cliques and the spectral radius
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
- On a conjecture of spectral extremal problems
- 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
- Spectral Extremal Problems for Hypergraphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Triple Systems Not Containing a Fano Configuration
- Proofs from THE BOOK
- Supersaturation problem for the bowtie
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- The chromatic number of {ISK4, diamond, bowtie}‐free graphs
- A complete solution to the Cvetković–Rowlinson conjecture
- Refinement on Spectral Turán’s Theorem
This page was built for publication: Spectral extremal graphs for the bowtie