Sciweavers

COMBINATORICS
2004
97views more  COMBINATORICS 2004»
13 years 3 months ago
Tight Estimates for Eigenvalues of Regular Graphs
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...
Alon Nilli
CPC
2007
64views more  CPC 2007»
13 years 3 months ago
Sampling Regular Graphs and a Peer-to-Peer Network
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...