Cliques and the spectral radius

DOI10.1016/j.jctb.2006.12.002zbMath1124.05058arXivmath/0608453OpenAlexW2070821446MaRDI QIDQ2642018

Vladimir Nikiforov, Béla Bollobás

Publication date: 20 August 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0608453

zbMATH Keywords

stabilityspectral radiusclique numbernumber of cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The general spectral radii of (multicone-)graphs with prescribed degree sequence, Signless Laplacian spectral radius of graphs without short cycles or long cycles, Spectral radius, edge-disjoint cycles and cycles of the same length, Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size, Proof of a conjecture on extremal spectral radii of blow-up graphs, A unique characterization of spectral extrema for friendship graphs, Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait, A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size, New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix, The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size, Spectral extremal graphs for the bowtie, Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size, The sum of the \(k\) largest distance eigenvalues of graphs, Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1, Refinement on Spectral Turán’s Theorem, The high order spectrum of a graph and its applications in graph colouring and clique counting, Spectral extremal graphs for disjoint cliques, Two conjectured strengthenings of Turán's theorem, Signed spectral Turań-type theorems, On the first two eigenvalues of regular graphs, The signless Laplacian spectral radius of graphs with a prescribed number of edges, Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size, A spectral extremal problem on non-bipartite triangle-free graphs, Spectral extremal problem on disjoint color-critical graphs, Dimension-free bounds and structural results in communication complexity, Counting substructures and eigenvalues. I: Triangles, Unnamed Item, Bounds on the spectral radius of general hypergraphs in terms of clique number, A spectral version of Mantel's theorem, Adjacency eigenvalues of graphs without short odd cycles, A Spectral Erdős–Stone–Bollobás Theorem, The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs, The sharp lower bound for the spectral radius of connected graphs with the independence number, A spectral condition for odd cycles in graphs, The maximum spectral radius of \(C_4\)-free graphs of given order and size, Eigenvalues and triangles in graphs, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles

Cites Work

• Walks and the spectral radius of graphs
• Spectral bounds for the clique and independence numbers of graphs
• Large generalized books are \(p\)-good
• Some Inequalities for the Largest Eigenvalue of a Graph
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item