A combinatorial proof of Ihara-Bass's formula for the zeta function of regular graphs
From MaRDI portal
Publication:5136339
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4165188 (Why is no real title available?)
- scientific article; zbMATH DE number 2042680 (Why is no real title available?)
- scientific article; zbMATH DE number 1495995 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
- Cutoff on all Ramanujan graphs
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander graphs and their applications
- How groups grow.
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- On the second eigenvalue of a graph
- Ramanujan graphs
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Zeta functions of finite graphs and coverings
Cited in
(8)- scientific article; zbMATH DE number 1552117 (Why is no real title available?)
- Ihara zeta function, coefficients of Maclaurin series and Ramanujan graphs
- The Ihara zeta function of the complement of a semiregular bipartite graph
- A note on the trace method for random regular graphs
- Heat kernels on regular graphs and generalized Ihara zeta function formulas
- A discrete Lefschetz formula
- A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
- The limit theorem with respect to the matrices on non-backtracking paths of a graph
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)