28 search results - page 2 / 6 » On the extreme eigenvalues of regular graphs |
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
SIAMDM
2010
13 years 10 days ago
2010
COMBINATORICS
2007
13 years 5 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
13 years 5 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
14 years 6 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. ...