Related papers: Ihara zeta functions for some simple graph familie…

Combinatorial properties of zeons have been applied to graph enumeration problems, graph colorings, routing problems in communication networks, partition-dependent stochastic integrals, and Boolean satisfiability. Power series of elementary…

In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a…

As well known, the study of Riemanns zeta function {\zeta}(s) involves the related entire function {\xi}(s). A close relative of {\zeta}(s) is the alternating zeta function {\eta}(s). Similar to {\zeta}(s), also {\eta}(s) has a…

In this paper we give some interesting identities between Euler numbers and zeta functions. Finally we will give the new values of Euler zeta function at positive even integers.

In this paper we propose a modification to the invariant polytope algorithm (ipa) using ideas of the finite expressible tree algorithm (feta) by M\"oller and Reif. We show that our new feta-flavoured-ipa applies to a wider range of matrix…

Let X be a regular scheme, projective and flat over Spec \mathbb Z. We give a conjectural formula, up to sign and powers of 2, for \zeta^*(X,r), the leading term in the series expansion of \zeta(X,s) at s=r, in terms of Weil-etale motivic…

Chung-Langlands established a matrix-tree theorem for positive-real valued vertex-weighted graphs, and Wu-Feng-Sato developed a theory of Ihara zeta functions for those graphs. In this paper, generalizing and refining these previous works,…

In this paper, we give an explicit formula of the Igusa local zeta function of a Thom-Sebastiani type sum of two separated-variable Newton non-critical polynomials. Data for the description are available on their Newton polyhedra.

Let $G$ be a bipartite graph with adjacency matrix $A(G)$. The characteristic polynomial $\phi(G,x)=\det(xI-A(G))$ and the permanental polynomial $\pi(G,x) = \text{per}(xI-A(G))$ are both graph invariants used to distinguish graphs. For…

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…

We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…

We propose a relation between values of the Riemann zeta function $\zeta$ and a family of integrals. This results in an integral representation for $\zeta(2p)$, where $p$ is a positive integer, and an expression of $\zeta(2p+1)$ involving…

Because of its relation to the distribution of prime numbers, the Riemann zeta function {\zeta} (s) is one of the most important functions in mathematics. The zeta function is defined by the following formula for any complex number s with…

We study the entire function zeta(n,s) which is the sum of l to the power -s, where l runs over the positive eigenvalues of the Laplacian of the circular graph C(n) with n vertices. We prove that the roots of zeta(n,s) converge for n to…

In this paper, we find recursive formulas for the Tutte polynomial of a family of small-world networks: Farey graphs, which are modular and have an exponential degree hierarchy. Then, making use of these formulas, we determine the number of…

We show that for a non-positive value of the first variable,Hurwitz zeta function becomes a polynomial in the second variable. We show this, using 'integration approach', instead of 'power series approach', which we had resorted to, in our…

We introduce a new graph polynomial in two variables. This ``interlace'' polynomial can be computed in two very different ways. The first is an expansion analogous to the state space expansion of the Tutte polynomial; the significant…

We investigate Solomon's zeta function for orders in the special case of orders generated by the standard basis of an integral table algebra, a special case of which is the integral adjacency algebra of an association scheme. As Solomon's…

We introduce a new method for constructing isospectral quantum graphs that is based on transplanting derivatives of eigenfunctions. We also present simple digraphs with the same reversing zeta function, which generalizes the Bartholdi zeta…

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…