Three conjectures in extremal spectral graph theory
From MaRDI portal
Publication:2399353
DOI10.1016/j.jctb.2017.04.006zbMath1368.05098arXiv1606.01916OpenAlexW2963128445MaRDI QIDQ2399353
Publication date: 22 August 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.01916
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
On the spread of outerplanar graphs, Graphs determined by their \(A_\alpha\)-spectra, Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals, On the spectral radius, energy and Estrada index of the arithmetic–geometric matrix of a graph, Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size, On the spectral radius, energy and Estrada index of the Sombor matrix of graphs, The spectral radius of graphs with no \(k_{2,t}\) minor, On the spectral radius of graphs without a star forest, 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 signless Laplacian spectral radius of graphs with forbidding linear forests, A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size, Spectral properties of the eccentricity matrix of graphs, On the eigenvalues of \(A_\alpha \)-matrix of graphs, On the spectral radius of minimally 2-(edge)-connected graphs with given size, A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, On the \(A_\alpha \)-spectral radius of graphs with given size, Outerplanar Turán numbers of cycles and paths, Spectral extremal graphs for the bowtie, A complete solution to the Cvetković–Rowlinson conjecture, Refinement on Spectral Turán’s Theorem, Maximum spectral radius of outerplanar 3‐uniform hypergraphs, On minimally 2-(edge)-connected graphs with extremal spectral radius, Unimodality of principal eigenvector and its applications, The maximum spectral radius of graphs without spanning linear forests, The unique spectral extremal graph for intersecting cliques or intersecting odd cycles, Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case, A spectral extremal problem on non-bipartite triangle-free graphs, The spectral radius of minor-free graphs, Characterization of outerplanar graphs whose second largest eigenvalue is at most 1, The maximum spectral radius of graphs of given size with forbidden subgraph, High dimensional Hoffman bound and applications in extremal combinatorics, Unnamed Item, Spectral extremal results with forbidding linear forests, Extremal spectral radius of \(K_{3,3}/K_{2,4}\)-minor free graphs, On the irregularity of uniform hypergraphs, The Colin de Verdière parameter, excluded minors, and the spectral radius, On the spectral radius and energy of the weighted adjacency matrix of a graph, The extremal \(\alpha \)-index of outerplanar and planar graphs, Unnamed Item, The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle, Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs, Eigenvalues and triangles in graphs, The graphs cospectral with the pineapple graph, Ordering graphs with given size by their signless Laplacian spectral radii, Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Erdős distinct distances problem in the plane
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Eigenvalues and degree deviation in graphs
- A contribution to the Zarankiewicz problem
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Spectral bounds for the clique and independence numbers of graphs
- A bound on the spectral radius of graphs
- Ramanujan graphs
- On the second eigenvalue of a graph
- A note on the irregularity of graphs
- The spectral radius of a planar graph
- Upper bounds of the spectral radius of graphs in terms of genus
- The spectral radius of graphs on surfaces
- Eigenvalues of subgraphs of the cube
- A bound on the spectral radius of graphs with \(e\) edges
- On the spectral radius and the genus of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Bipartite subgraphs
- Some new results in extremal graph theory
- Some Inequalities for the Largest Eigenvalue of a Graph
- A Spectral Erdős–Stone–Bollobás Theorem
- Maximum hitting time for random walks on graphs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Characterizing graphs of maximum principal ratio
- The largest eigenvalue of a graph: A survey
- On Sets of Distances of n Points