A combinatorial proof of Ihara-Bass's formula for the zeta function of regular graphs

DOI10.4230/LIPICS.FSTTCS.2017.46zbMATH Open1493.05197arXiv1706.00851OpenAlexW2790814983MaRDI QIDQ5136339FDOQ5136339

Authors: Bharatram Rangarajan 

Publication date: 25 November 2020

Abstract: We give an elementary combinatorial proof of Bass's determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in the eigenvalues of the adjacency operator of the graph.

Full work available at URL: https://arxiv.org/abs/1706.00851

Recommendations

• scientific article; zbMATH DE number 1552117
• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• scientific article; zbMATH DE number 1495995
• Ihara zeta functions for periodic simple graphs
• Zeta functions of graphs. A stroll through the garden

zbMATH Keywords

Chebyshev polynomialRamanujan graphnon-backtrackingHashimoto matrixIhara zeta

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Enumeration in graph theory (05C30) Paths and cycles (05C38) Zeta and (L)-functions in characteristic (p) (11M38) Other Dirichlet series and zeta functions (11M41)

Cites Work

• Title not available (Why is that?)
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Zeta functions of finite graphs and coverings
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• Expander graphs and their applications
• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• Title not available (Why is that?)
• Ramanujan graphs
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• On the second eigenvalue of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cutoff on all Ramanujan graphs
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• How groups grow.

Cited In (7)

• Title not available (Why is that?)
• A note on the trace method for random regular graphs
• The Ihara zeta function of the complement of a semiregular bipartite graph
• Heat kernels on regular graphs and generalized Ihara zeta function formulas
• A discrete Lefschetz formula
• The limit theorem with respect to the matrices on non-backtracking paths of a graph
• Ihara Zeta function, coefficients of Maclaurin series and Ramanujan graphs

This page was built for publication: A combinatorial proof of Ihara-Bass's formula for the zeta function of regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136339)