Eigenvalues and expanders

Combinatorica

Volumn 6, Issue 2, 1986, Pages 83-96

  Alon, Noga ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

AMS subject classification (1980): 05C99, 05C50, 68E10

Indexed keywords

EID: 51249173340     PISSN: 02099683     EISSN: 14396912     Source Type: Journal    
DOI: 10.1007/BF02579166     Document Type: Article

References (34)

1. A note on time space tradeoffs for computing continuous functions
2. Sorting in c log n parallel steps
3. λ1, isoperimetric inequalities for graphs and superconcentrators
4. Asymptotically optimal switching circuits
5. The complexity of testing whether a graph is a superconcentrator
6. A. probabilistic proof of an asymptotic formula for the number of labelled regular graphs
7. Cubic graphs and the first eigenvalue of a Riemann surface
8. A lower bound for the smallest eigenvalue of the Laplacian
9. On concentrators, superconcentrators, generalizers and nonblocking networks
10. Some possible directions in further investigations of graph spectra
11. The eigenvalues of random symmetric matrices
12. Explicit construction of linear sized superconcentrators
13. A topological application of the isoperimetric inequality
14. Asymptotically tight bounds on time space tradeoffs in a pebble game
15. Explicit constructions of concentrators
16. The expected eigenvalue distribution of a large regular graph
17. Superconcentrators
18. Advances in pebbling
19. Space bounds for a game on graphs
20. Fault tolerant interconnection networks; a graph theoretic approach
21. Explicit construction of concentrators from generalized N-gons
22. Time space tradeoffs for computing functions using connectivity properties of their circuits
23. Graph theoretic properties in computational complexity
24. On the distribution of the roots of certain symmetric matrices