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

In this paper, we study the Igusa's local zeta functions of a class of hybrid polynomials with coefficients in a non-archimedean local field of positive characteristic. Such class of hybrid polynomial was first introduced by Hauser in 2003…

The third author introduced the $g$-polynomial $g_M(t)$ of a matroid, a covaluative matroid statistic which is unchanged under series and parallel extension. The $g$-polynomial of a rank $r$ matroid $M$ has the form $g_1 t + g_2 t^2 +…

We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree $T$ is the generating function of a class of subtrees of $T$. We prove that the polynomial is a complete isomorphism…

Recently, T. Kim considered Euler zeta function which interpolates Euler polynomials at negative integer (see [3]). In this paper, we study degenerate Euler zeta function which is holomorphic function on complex s-plane associated with…

The second derivative of a function r(t) with respect to a variable t is equal to -n times the function raised to the 2n-1 power of r(t); using this definition, an ordinary differential equation is constructed. Graphs with the horizontal…

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation…

We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those…

Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in…

Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial…

We define a zeta function woth respect to the twisted Grover matrix of a mixed digraph, and present an exponential expression and a determinant expression of this zeta function. As an application, we give a trace formula with respect to the…

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

In this article, we study the multiple zeta functions (MZF) and some of its variants at identical arguments. Using the harmonic product, these functions can be expressed as polynomials in the Riemann zeta function. Firstly, we note that an…

If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$ in graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). J. I. Brown, K. Dilcher and…

We prove that if two graphs of girth at least 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of…

Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta…

We consider a certain linear combination $S(\mathbf{s},\mathbf{y};I;\Delta)$ of zeta-functions of root systems, where $\Delta$ is a root system of rank $r$ and $I\subset\{1,2,\ldots,r\}$. Showing two different expressions of…

Goda showed that the twisted Alexander polynomial can be recovered from the zeta function of a matrix-weighted graph. Motivated by this, we study transformations of weighted graphs that preserve this zeta function, introducing a notion of…

We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph $G$ with order n and strong defensive alliance number $a(G)$ is the polynomial $a(G;x):=\sum_{i=a(G)}^{n}\, a_i(G)\ x^i$, where $a_{k}(G)$ is…

We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial…

An invertible polynomial in $n$ variables is a quasihomogeneous polynomial consisting of $n$ monomials so that the weights of the variables and the quasi-degree are well defined. In the framework of the construction of mirror symmetric…