Spectral extrema of graphs: forbidden hexagon
From MaRDI portal
Publication:785828
DOI10.1016/j.disc.2020.112028zbMath1445.05055OpenAlexW3034493717MaRDI QIDQ785828
Publication date: 12 August 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112028
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Signless Laplacian spectral radius of graphs without short cycles or long cycles, Spectral radius, edge-disjoint cycles and cycles of the same length, Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals, A spectral condition for the existence of the square of a path, The maximum spectral radius of wheel-free graphs, A unique characterization of spectral extrema for friendship graphs, On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees, The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size, A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size, The maximum spectral radius of graphs without spanning linear forests, Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles, An \(A_\alpha\)-spectral Erdős-Pósa theorem, On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles, Spectral radius of graphs of given size with forbidden subgraphs, The unique spectral extremal graph for intersecting cliques or intersecting odd cycles, Spectral radius conditions for the existence of all subtrees of diameter at most four, Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs, The index of signed graphs with forbidden subgraphs, Extremal results for \(C_3^-\)-free signed graphs, Spectral Turán problems for intersecting even cycles, An \(A_{\alpha}\)-spectral Erdős-Sós theorem, Stability of Woodall's theorem and spectral conditions for large cycles, The maximum spectral radius of graphs of given size with forbidden subgraph, A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs, Unnamed Item, Unnamed Item, Adjacency eigenvalues of graphs without short odd cycles, The signless Laplacian spectral radius of graphs with no intersecting triangles
Cites Work
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- A contribution to the Zarankiewicz problem
- Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
- The spectral radius of graphs without paths and cycles of specified length
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extremal results with forbidding linear forests
- Cycles of even length in graphs
- On the number of edges of quadrilateral-free graphs
- Spectral conditions for the existence of specified paths and cycles in graphs
- A new upper bound for the spectral radius of graphs with girth at least 5
- Spectral extrema for graphs: the Zarankiewicz problem
- Bounds on graph eigenvalues. II
- A spectral condition for odd cycles in graphs
- On the Turán number for the hexagon
- Pancyclic graphs. I
- Large cycles in graphs
- Some new results in extremal graph theory
- Über ein Problem von K. Zarankiewicz
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- Extremal Numbers for Odd Cycles
- Sufficient Conditions for Circuits in Graphs†
- On a problem of K. Zarankiewicz
- On the theory of graphs
