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.
"synopsis" may belong to another edition of this title.
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 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.
"It would make a great text for an honors or senior seminar, showing how elegantly many different areas of mathematics come together to solve a very concrete problem of broad interest and application." Mathematical Reviews
"...a well written and stimulating book." MAA Online Book Review
"About this title" may belong to another edition of this title.
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Seller Inventory # OTV.0521824265.G
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 2309061
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 2309061-n
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: 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: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780521824262_new
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
Quantity: 5 available