A self-contained treatment of expander graphs which are important in computer science, engineering and mathematics.
"synopsis" may belong to another edition of this title.
'The book under review is an attractively written excellent text which successfully bridges the gap between undergraduate instruction and current research. Hence it is very well suited to bring a fresh breeze into the classroom. The reviewer warmly recommends this text to any lecturer looking for an attractive theme and to everybody else for great supplementary reading. Of course, this book should not be missed in any institutional library.' Zentralblatt MATH
'A light touch and the inclusion of some unexpected results make the book a pleasure to read.' Mathematika
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.
"About this title" may belong to another edition of this title.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 2309061-n
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 2309061
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521824262
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 2309061
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 2309061-n
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780521824262_new
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 applicat. Seller Inventory # 446948983
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521824262
Quantity: 1 available
Seller: preigu, Osnabrück, Germany
Buch. Condition: Neu. Elementary Number Theory, Group Theory and Ramanujan Graphs | Giuliana Davidoff (u. a.) | Buch | Gebunden | Englisch | 2010 | Cambridge University Press | EAN 9780521824262 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 101226909
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. A self-contained treatment of expander graphs which are important in computer science, engineering and mathematics. Series: London Mathematical Society Student Texts. Num Pages: 156 pages, Illustrations. BIC Classification: PBG; PBH; PBV. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 13. Weight in Grams: 339. . 2003. Illustrated. hardcover. . . . . Books ship from the US and Ireland. Seller Inventory # V9780521824262