Cliques and the spectral radius
From MaRDI portal
Publication:2642018
DOI10.1016/J.JCTB.2006.12.002zbMATH Open1124.05058arXivmath/0608453OpenAlexW2070821446MaRDI QIDQ2642018FDOQ2642018
Authors: Béla Bollobás, Vladimir Nikiforov 
Publication date: 20 August 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Abstract: We present a number of relations involving the number of cliques in a graph and its spectral radius.
Full work available at URL: https://arxiv.org/abs/math/0608453
Recommendations
- Some Inequalities for the Largest Eigenvalue of a Graph
- More spectral bounds on the clique and independence numbers
- Spectral bounds for the clique and independence numbers of graphs
- Spectral radius and clique partitions of graphs
- Spectral extrema of graphs with bounded clique number and matching number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Title not available (Why is that?)
- Some Inequalities for the Largest Eigenvalue of a Graph
- Title not available (Why is that?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Large generalized books are \(p\)-good
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Walks and the spectral radius of graphs
- Spectral bounds for the clique and independence numbers of graphs
Cited In (52)
- Maxima of the \(A_\alpha\)-spectral radius of graphs with given size and minimum degree \(\delta \ge 2\)
- Note on Mantel theorem and Turán theorem
- Adjacency eigenvalues of graphs without short odd cycles
- Spectral radius and clique partitions of graphs
- Eigenvalues and triangles in graphs
- A spectral condition for odd cycles in graphs
- Bounds on the spectral radius of general hypergraphs in terms of clique number
- A spectral Erdős-Rademacher theorem
- A Brualdi-Hoffman-Turán problem on cycles
- Two conjectured strengthenings of Turán's theorem
- The sum of degrees in cliques
- Dimension-free bounds and structural results in communication complexity
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- A note on the signless Laplacian spectral ordering of graphs with given size
- Maxima of the \(Q\)-index of leaf-free graphs with given size
- Maxima of the Q ( L )-index of (minimally) 2-edge-connected graphs with given size
- On the first two eigenvalues of regular graphs
- Spectral extrema of graphs with fixed size: forbidden triangles and pentagons
- Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
- The high order spectrum of a graph and its applications in graph colouring and clique counting
- Refinement on Spectral Turán’s Theorem
- The general spectral radii of (multicone-)graphs with prescribed degree sequence
- Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size
- A spectral version of Mantel's theorem
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- Proof of a conjecture on extremal spectral radii of blow-up graphs
- Title not available (Why is that?)
- A spectral extremal problem on non-bipartite triangle-free graphs
- Spectral extremal problem on disjoint color-critical graphs
- The sum of the \(k\) largest distance eigenvalues of graphs
- Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
- The clique density theorem
- A spectral Erdős-Stone-Bollobás theorem
- Spectral extremal graphs for the bowtie
- The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
- Title not available (Why is that?)
- 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 maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- Spectral extremal graphs for disjoint cliques
- Signed spectral Turań-type theorems
- On cliques and bicliques
- Friendship destroys orderability via clustering pseudogaps
- Spectral radius, edge-disjoint cycles and cycles of the same length
- Counting substructures and eigenvalues. I: Triangles
- The sharp lower bound for the spectral radius of connected graphs with the independence number
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Odd pairs of cliques
This page was built for publication: Cliques and the spectral radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642018)
