2270 search results - page 5 / 454 » On the distribution of eigenvalues of graphs |
IMC
2010
ACM
14 years 7 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
81
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
JCT
2007
14 years 9 months ago
2007
We study the spectral radius of connected non-regular graphs. Let λ1(n,Δ) be the maximum spectral radius among all connected non-regular graphs with n vertices and maximum degre...
COMBINATORICS
2004
14 years 9 months ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
100
Voted
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...