Elementary number theory, group theory, and Ramanujan graphs /
This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering.
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | |
Otros Autores: | , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
New York :
Cambridge University Press,
2003.
|
Colección: | London Mathematical Society student texts ;
55. |
Temas: | |
Acceso en línea: | Texto completo |
Sumario: | This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. |
---|---|
Descripción Física: | 1 online resource (viii, 144 pages) : illustrations |
Bibliografía: | Includes bibliographical references (pages 138-141) and index. |
ISBN: | 0511078668 9780511078668 0511077092 9780511077098 9780521824262 9780521531436 0521824265 0521531438 |