By Giuliana Davidoff
By Peter Sarnak
By Alain Valette
Publisher: Cambridge University Press
Print Publication Year:2003
Online Publication Date:December 2009
This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of elementary algebra, analysis and combinatorics is required because the authors provide the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.
No references available.