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

DOI10.4230/LIPIcs.FSTTCS.2017.46zbMath1493.05197arXiv1706.00851OpenAlexW2790814983MaRDI QIDQ5136339

Bharatram Rangarajan

Publication date: 25 November 2020

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

zbMATH Keywords

Chebyshev polynomialRamanujan graphnon-backtrackingHashimoto matrixIhara zeta

Mathematics Subject Classification ID

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

Related Items

A note on the trace method for random regular graphs ⋮ 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

Cites Work

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