λ1, Isoperimetric inequalities for graphs, and superconcentrators

434Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A general method for obtaining asymptotic isoperimetric inequalities for families of graphs is developed. Some of these inequalities have been applied to functional analysis. This method uses the second smallest eigenvalue of a certain matrix associated with the graph and it is the discrete version of a method used before for Riemannian manifolds. Also some results are obtained on spectra of graphs that show how this eigenvalue is related to the structure of the graph. Combining these results with some known results on group representations many new examples are constructed explicitly of linear sized expanders and superconcentrators. © 1985.

Cite

CITATION STYLE

APA

Alon, N., & Milman, V. D. (1985). λ1, Isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, 38(1), 73–88. https://doi.org/10.1016/0095-8956(85)90092-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free