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. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.
- ISBN13 9780511075551
- Publish Date 2 February 2005 (first published 20 January 2003)
- Publish Status Active
- Publish Country GB
- Publisher Cambridge University Press
- Imprint Cambridge University Press (Virtual Publishing)
- Format eBook
- Language English