Related papers: Some graph properties determined by edge zeta func…
We define a new weighted zeta function for a finite graph and obtain its determinant expression. This result gives the characteristic polynomial of the transition matrix of the Szegedy walk on a graph.
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
We consider the generalized weighted zeta function for a finite digraph, and show that it has the Ihara expression, a determinant expression of graph zeta functions, with a certain specified definition for inverse arcs. A finite digraph in…
We show that if a graph $G$ has average degree $\bar d \geq 4$, then the Ihara zeta function of $G$ is edge-reconstructible. We prove some general spectral properties of the edge adjacency operator $T$: it is symmetric for an indefinite…
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…
We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the…
The theory of Ihara zeta functions is extended to infinite graphs which are weighted and of finite total weight. In this case one gets meromorphic instead of rational functions and the classical determinant formulas of Bass and Ihara hold…
In this paper, we study graph-theoretic analogies of the Mertens' theorems by using basic properties of the Ihara zeta-function. One of our results is a refinement of a special case of the dynamical system Mertens' second theorem due to…
In this paper, we present formulas for the edge zeta function and the second weighted zeta function with respect to the group matrix of a finite abelian group $\Gamma $. Furthermore, we give another proof of Dedekind Theorem for the group…
We define a zeta function of a finite graph derived from time evolution matrix of quantum walk, and give its determinant expression. Furthermore, we generalize the above result to a periodic graph.
We propose a novel fermionic model on the graphs. The Dirac operator of the model consists of deformed incidence matrices on the graph and the partition function is given by the inverse of the graph zeta function. We find that the…
In this paper, we give a more direct proof of the results by Clair and Mokhtari-Sharghi on the zeta functions of periodic graphs. In particular, using appropriate operator-algebraic techniques, we establish a determinant formula in this…
Partial zeta functions of algebraic varieties over finite fields generalize the classical zeta function by allowing each variable to be defined over a possibly different extension field of a fixed finite field. Due to this extra variation…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
We initiate the study of spectral zeta functions $\zeta_{X}$ for finite and infinite graphs $X$, instead of the Ihara zeta function, with a perspective towards zeta functions from number theory and connections to hypergeometric functions.…
Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…
To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…
To an ideal in $\mathbb{C}[x,y]$ one can associate a topological zeta function. This is an extension of the topological zeta function associated to one polynomial. But in this case we use a principalization of the ideal instead of an…
Curves over finite fields are of great importance in cryptography and coding theory. Through studying their zeta-functions, we would be able to find out vital arithmetic and geometric information about them and their Jacobians, including…
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factorizations. For $(d,r)$-regular hypergraphs, we show that a modified…