A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Graph Characteristics from the Ihara Zeta Function
[chapter]
2008
Lecture Notes in Computer Science
This paper shows how to extract permutation invariant graph characteristics from the Ihara zeta function. In a previous paper, we have shown that the Ihara zeta function leads to a polynomial characterization of graph structure, and we have shown empirically that the coefficients of the polynomial can be used as to cluster graphs. The aim in this paper is to take this study further by showing how to select the most significant coefficients and how these can be used to gauge graph similarity.
doi:10.1007/978-3-540-89689-0_30
fatcat:ko7oifc4dffslnsvp437fzcu7m