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.









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)