Combinatorica

, Volume 6, Issue 2, pp 83–96

Eigenvalues and expanders

Authors

  • Noga Alon
    • Department of MathematicsMassachusetts Inst. of Technology
    • Department of MathematicsTel Aviv University
Article

DOI: 10.1007/BF02579166

Cite this article as:
Alon, N. Combinatorica (1986) 6: 83. doi:10.1007/BF02579166

Abstract

Linear expanders have numerous applications to theoretical computer science. Here we show that a regular bipartite graph is an expanderif and only if the second largest eigenvalue of its adjacency matrix is well separated from the first. This result, which has an analytic analogue for Riemannian manifolds enables one to generate expanders randomly and check efficiently their expanding properties. It also supplies an efficient algorithm for approximating the expanding properties of a graph. The exact determination of these properties is known to be coNP-complete.

AMS subject classification (1980)

05 C 9905 C 5068 E 10

Copyright information

© Akadémiai Kiadó 1986