English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

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