Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
From MaRDI portal
Publication:6090845
DOI10.4134/JKMS.J220341zbMATH Open1527.05114MaRDI QIDQ6090845FDOQ6090845
Authors: Shuchao Li, Wanting Sun, Wei Wei
Publication date: 20 November 2023
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)
Cites Work
- 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
- The history of degenerate (bipartite) extremal graph problems
- Title not available (Why is that?)
- On the structure of linear graphs
- The spectral radius of trees on \(k\) pendant vertices
- Graphs and matrices
- 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
- Regular graphs, eigenvalues and regular factors
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- On a class of degenerate extremal graph problems
- On the Turán number of theta graphs
- Turán numbers of theta graphs
- Spectral extremal results with forbidding linear forests
- On the spectrum of an equitable quotient matrix and its application
- Extremal numbers for odd cycles
- Spectral extrema of graphs: forbidden hexagon
- Three conjectures in extremal spectral graph theory
- Graphs without theta subgraphs
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- The maximum spectral radius of graphs without friendship subgraphs
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Eigenvalues and triangles in graphs
- A spectral condition for the existence of a pentagon in non-bipartite graphs
- Extremal Theta-free planar graphs
- A complete solution to the Cvetković–Rowlinson conjecture
- Adjacency eigenvalues of graphs without short odd cycles
- On the spectral radius of graphs without a star forest
- Edge-maximal graphs without \(\theta_{2k+1}\)-graphs
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- Edge-maximal graphs without \(\theta_5\)-graphs.
Cited In (3)
This page was built for publication: Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090845)