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.
Piracy-free
Assured Quality
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.