A unique characterization of spectral extrema for friendship graphs
From MaRDI portal
Publication:2170783
DOI10.37236/11183zbMath1496.05107MaRDI QIDQ2170783
Jie Xue, Ming-qing Zhai, Rui-fang Liu
Publication date: 6 September 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/11183
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the graph removal lemma
- Spectral extrema of graphs: forbidden hexagon
- A contribution to the Zarankiewicz problem
- The spectral radius of graphs without paths and cycles of specified length
- Spectral saturation: inverting the spectral Turán theorem
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extremal results with forbidding linear forests
- The spectral radius of graphs without long cycles
- Extremal graphs for intersecting triangles
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- Spectral extremal graphs for intersecting cliques
- The spectral radius of graphs with no intersecting odd cycles
- The maximum spectral radius of graphs without friendship subgraphs
- The spectral radius of graphs with no odd wheels
- Spectral extrema for graphs: the Zarankiewicz problem
- Three conjectures in extremal spectral graph theory
- Bounds on graph eigenvalues. II
- On some Ramsey and Turán-type numbers for paths and cycles
- Cliques and the spectral radius
- On the spectral radius of graphs without a star forest
- Some new results in extremal graph theory
- A note on the largest eigenvalue of non-regular graphs
- A Spectral Erdős–Stone–Bollobás Theorem
- A complete solution to the Cvetković–Rowlinson conjecture