Name
Abstract | ||
|---|---|---|
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue @m(G) of its adjacency matrix. In particular, writing k"s(G) for the number of s-cliques of G, we show that, for all r=2,@m^r^+^1(G)==(@m(G)n-1+1r)r(r-1)r+1(nr)^r^+^1. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.jctb.2006.12.002 | Journal of Combinatorial Theory Series B |
Keywords | DocType | Volume |
largest eigenvalue,spectral radius,graph g,adjacency matrix,stability | Journal | 97 |
Issue | ISSN | Citations |
5 | 0095-8956 | 1 |
PageRank | References | Authors |
0.41 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Béla Bollobás | 1 | 2696 | 474.16 |
| Vladimir Nikiforov | 2 | 124 | 20.26 |