DocumentCode :
2892285
Title :
Better expansion for Ramanujan graphs
Author :
Kahale, Nabil
Author_Institution :
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
fYear :
1991
fDate :
1-4 Oct 1991
Firstpage :
398
Lastpage :
404
Abstract :
The expansion properties of regular graphs are investigated. The best previously known expansion of subsets of linear size of explicit k-regular graphs is k/4. This bound is achieved by nonbipartite Ramanujan graphs of degree k=p+1, which have the property that all but the largest eigenvalue have absolute value at most 2√p. The expansion coefficient for linear subsets for nonbipartite Ramanujan graphs is improved to 3(k-2)/8. Other results are established, including improved results about random walks on expanders
Keywords :
eigenvalues and eigenfunctions; graph theory; Ramanujan graphs; eigenvalue; expanders; expansion properties; explicit k-regular graphs; random walks; regular graphs; Application software; Complexity theory; Computer science; Contracts; Cryptography; Eigenvalues and eigenfunctions; Graph theory; Laboratories; Routing; Sorting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
Type :
conf
DOI :
10.1109/SFCS.1991.185397
Filename :
185397
Link To Document :
بازگشت