28 search results - page 2 / 6 » On the extreme eigenvalues of regular graphs |
64
Voted
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
63
Voted
SIAMDM
2010
14 years 4 months ago
2010
92
Voted
COMBINATORICS
2007
14 years 9 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and finite di...
CPC
2002
14 years 9 months ago
2002
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...