Zeta functions of graphs: a stroll through the garden
Publication details: Cambridge University Press, 2010. Cambridge:Description: xii, 239 p. : ill. ; hb, 23 cmISBN:- 9780521113670
- 511.5 TER
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
![]() |
IIT Gandhinagar General Stacks | General | 511.5 TER (Browse shelf(Opens below)) | Available | 030184 |
Browsing IIT Gandhinagar shelves, Shelving location: General Stacks, Collection: General Close shelf browser (Hides shelf browser)
Includes bibliographical references (p. 230-235) and index.
Graph theory meets number theory in this stimulating book. Ihara zeta functions of finite graphs are reciprocals of polynomials, sometimes in several variables. Analogies abound with number-theoretic functions such as Riemann/Dedekind zeta functions. For example, there is a Riemann hypothesis (which may be false) and prime number theorem for graphs. Explicit constructions of graph coverings use Galois theory to generalize Cayley and Schreier graphs. Then non-isomorphic simple graphs with the same zeta are produced, showing you cannot hear the shape of a graph. The spectra of matrices such as the adjacency and edge adjacency matrices of a graph are essential to the plot of this book, which makes connections with quantum chaos and random matrix theory, plus expander/Ramanujan graphs of interest in computer science. Pitched at beginning graduate students, the book will also appeal to researchers. Many well-chosen illustrations and diagrams, and exercises throughout, theoretical and computer-based.
There are no comments on this title.