Properties determined by the Ihara zeta function of a graph
Summary: We show how to determine several properties of a finite graph \(G\) from its Ihara zeta function \(Z_G(u)\). If \(G\) is connected and has minimal degree at least 2, we show how to calculate the number of vertices of \(G\). To do so we use a result of Bass, and in the case that \(G\) is nonbipartite, we give an elementary proof of Bass' result. We further show how to determine whether \(G\) is regular, and if so, its regularity and spectrum. On the other hand, we extend work of Czarneski to give several infinite families of pairs of non-isomorphic non-regular graphs with the same Ihara zeta function. These examples demonstrate that several properties of graphs, including vertex and component numbers, are not determined by the Ihara zeta function. We end with Hashimoto's edge matrix \(T\). We show that any graph \(G\) with no isolated vertices can be recovered from its \(T\) matrix. Since graphs with the same Ihara zeta function are exactly those with isospectral \(T\) matrices, this relates again to the question of what information about \(G\) can be recovered from its Ihara zeta function.
- Bartholdi zeta functions of generalized join graphs
- Edge reconstruction of the Ihara zeta function
- Enumeration of graphs with the same Ihara zeta function
- The Ihara-zeta function and the spectrum of the join of two semi-regular bipartite graphs
- Ihara zeta functions of coronae
- The Ihara zeta function of the complement of a semiregular bipartite graph
- Ihara zeta function and spectrum of the cone over a semiregular bipartite graph
- Distinguishing graphs with zeta functions and generalized spectra
- Graph characterization by counting sink star subgraphs
- On the Ihara zeta function of cones over regular graphs
- A characteristic polynomial for the transition probability matrix of correlated random walks on a graph
- The coefficients of the reduced Bartholdi zeta function
- On the Ihara zeta function and resistance distance-based indices
- Ihara zeta functions and cospectrality of joins of regular graphs
- There is no going back: properties of the non-backtracking Laplacian
- Some properties of graphs determined by edge zeta functions
- Maximal colourings for graphs
- Zeta functions of signed graphs
- Spectral properties of generalized Paley graphs of (q^+1)th powers and applications
- On a construction using commuting regular graphs
This page was built for publication: Properties determined by the Ihara zeta function of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380239)
