Zeta functions of line, middle, total graphs of a graph and their coverings

We consider the (Ihara) zeta functions of line graphs, middle graphs and total graphs of a regular graph and their (regular or irregular) covering graphs. Let L(G), M(G) and T(G) denote the line, middle and total graph of G, respectively. We show that the line, middle and total graph of a (regular and irregular, respectively) covering of a graph G is a (regular and irregular, respectively) covering of L(G), M(G) and T(G), respectively. For a regular graph G, we express the zeta functions of the line, middle and total graph of any (regular or irregular) covering of G in terms of the characteristic polynomial of the covering. Also, the complexities of the line, middle and total graph of any (regular or irregular) covering of G are computed. Furthermore, we discuss the L-functions of the line, middle and total graph of a regular graph G.     

Weighted Bartholdi zeta functions of graph coverings

We define the weighted Bartholdi zeta function and a weighted L-function of a graph G, and give determinant expressions of them. Furthermore, we present a decomposition formula for the weighted Bartholdi zeta function of a regular covering of G by weighted L-functions of G.     

The edge L-function of a graph

We extend Watanabe and Fukumizu’s Theorem on the edge zeta function to a regular covering of a graph G. Next, we define an edge L-function of a graph G, and give a determinant expression of it. As a corollary, we present a decomposition formula for the edge zeta function of a regular covering of G by a product of edge L-functions of G.     

A new Bartholdi zeta function of a digraph II

We introduce a new type of the Bartholdi zeta function of a digraph D. Furthermore, we define a new type of the Bartholdi L-function of D, and give a determinant expression of it. We show that this L-function of D is equal to the L-function of D defined in [H. Mizuno, I. Sato, A new Bartholdi zeta function of a digraph, Linear Algebra Appl. 423 (2007) 498-511]. As a corollary, we obtain a decomposition formula for a new type of the Bartholdi zeta function of a group covering of D by new Bartholdi L-functions of D.     

Weighted zeta functions for quotients of regular coverings of graphs

Let G be a connected graph. We reformulate Stark and Terras' Galois Theory for a quotient H of a regular covering K of a graph G by using voltage assignments. As applications, we show that the weighted Bartholdi L-function of H associated to the representation of the covering transformation group of H is equal to that of G associated to its induced representation in the covering transformation group of K. Furthermore, we express the weighted Bartholdi zeta function of H as a product of weighted Bartholdi L-functions of G associated to irreducible representations of the covering transformation group of K. We generalize Stark and Terras' Galois Theory to digraphs, and apply to weighted Bartholdi L-functions of digraphs.     

The scattering matrix with respect to an Hermitian matrix of a graph

Recently, Gnutzmann and Smilansky [5] presented a formula for the bond scattering matrix of a graph with respect to an Hermitian matrix. We present another proof for this formula by a technique use in the zeta function of a graph. Furthermore, we generalize Gnutzmann and Smilansky's formula to a regular covering of a graph. Finally, we define an L-function of a graph, and present a determinant expression. As a corollary, we express the generalization of Gnutzmann and Smilansky's formula to a regular covering of a graph by using its L-functions.     

The weighted complexity and the determinant functions of graphs

The complexity of a graph can be obtained as a derivative of a variation of the zeta function [S. Northshield, A note on the zeta function of a graph, J. Combin. Theory Ser. B 74 (1998) 408-410] or a partial derivative of its generalized characteristic polynomial evaluated at a point [D. Kim, H.K. Kim, J. Lee, Generalized characteristic polynomials of graph bundles, Linear Algebra Appl. 429 (4) (2008) 688-697]. A similar result for the weighted complexity of weighted graphs was found using a determinant function [H. Mizuno, I. Sato, On the weighted complexity of a regular covering of a graph, J. Combin. Theory Ser. B 89 (2003) 17-26]. In this paper, we consider the determinant function of two variables and discover a condition that the weighted complexity of a weighted graph is a partial derivative of the determinant function evaluated at a point. Consequently, we simply obtain the previous results and disclose a new formula for the complexity from a variation of the Bartholdi zeta function. We also consider a new weighted complexity, for which the weights of spanning trees are taken as the sum of weights of edges in the tree, and find a similar formula for this new weighted complexity. As an application, we compute the weighted complexities of the product of the complete graphs.     

Scattering matrices of regular coverings of graphs

We give a decomposition formula for the determinant on the bond scattering matrix of a regular covering of G. Furthermore, we define an L-function of G, and give a determinant expression of it. As a corollary, we express the determinant on the bond scattering matrix of a regular covering of G by means of its L-functions.     

Weighted scattering matrices of regular coverings of graphs

We give a decomposition formula for the determinant det(I ? U(λ)) of the weighted bond scattering matrix U(λ) of a regular covering of G. Furthermore, we define an L-function of G, and give a determinant expression of it. As a corollary, we express some determinant of the weighted bond scattering matrix of a regular covering of G by means of its L-functions.     

New proofs for Levine’s theorems

Recently, Levine [9] expressed the vertex weighted complexity on spanning trees (with a fixed root) of the directed line graph of a digraph D in terms of the edge weighted complexity on spanning trees (with a fixed root) of D. We present new proofs for two Levine’s Theorems. Furthermore, we express the number of unicycles of the directed line graph of a digraph D in terms of the number of unicycles of D.     

Some properties of graphs determined by edge zeta functions

In 1989, Hashimoto introduced an edge zeta function of a finite graph, which is a generalization of the Ihara zeta function. The edge zeta function is the reciprocal of a polynomial in twice as many indeterminants as edges in the graph and can be computed via a determinant expression. We look at graph properties which we can determine using the edge zeta function. In particular, the edge zeta function is enough to deduce the clique number, the number of Hamiltonian cycles, and whether a graph is perfect or chordal. Finally, we present a new example illustrating that the Ihara zeta function cannot necessarily do the same.     

Zeta and <Emphasis Type="Italic">L</Emphasis>-functions of finite quotients of apartments and buildings

In this paper, we study relations between Langlands L-functions and zeta functions of geodesic walks and galleries for finite quotients of the apartments of G =PGL₃ and PGSp₄ over a nonarchimedean local field with q elements in its residue field. They give rise to an identity (Theorem 5.3) which can be regarded as a generalization of Ihara’s theorem for finite quotients of the Bruhat–Tits trees. This identity is shown to agree with the q = 1 version of the analogous identities for finite quotients of the building of G established in [KL14, KLW10, FLW13], verifying the philosophy of the field with one element by Tits. A new identity for finite quotients of the building of PGSp₄ involving the standard L-function (Theorem 6.3), complementing the one in [FLW13] which involves the spin L-function, is also obtained.     

Generalized characteristic polynomials of graph bundles

In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic polynomial of the graph. Since the reciprocal of the Bartholdi zeta function of a graph can be derived from the generalized characteristic polynomial of a graph, consequently, the Bartholdi zeta function of a graph bundle can be computed by using our computational formulae.     

A generalized characteristic polynomial of a graph having a semifree action

For an abelian group Γ, a formula to compute the characteristic polynomial of a Γ-graph has been obtained by Lee and Kim [Characteristic polynomials of graphs having a semi-free action, Linear algebra Appl. 307 (2005) 35-46]. As a continuation of this work, we give a computational formula for generalized characteristic polynomial of a Γ-graph when Γ is a finite group. Moreover, after showing that the reciprocal of the Bartholdi zeta function of a graph can be derived from the generalized characteristic polynomial of a graph, we compute the reciprocals of the Bartholdi zeta functions of wheels and complete bipartite graphs as an application of our formula.     

Asymptotic properties of zeta functions over finite fields

In this paper we study asymptotic properties of families of zeta and L-functions over finite fields. We do it in the context of three main problems: the basic inequality, the Brauer–Siegel type results and the results on distribution of zeroes. We generalize to this abstract setting the results of Tsfasman, Vlăduţ and Lachaud, who studied similar problems for curves and (in some cases) for varieties over finite fields. In the classical case of zeta functions of curves we extend a result of Ihara on the limit behaviour of the Euler–Kronecker constant. Our results also apply to L-functions of elliptic surfaces over finite fields, where we approach the Brauer–Siegel type conjectures recently made by Kunyavskii, Tsfasman and Hindry.     

An arithmetic formula for certain coefficients of the Euler product of Hecke polynomials

In 1997 the author found a criterion for the Riemann hypothesis for the Riemann zeta function, involving the nonnegativity of certain coefficients associated with the Riemann zeta function. In 1999 Bombieri and Lagarias obtained an arithmetic formula for these coefficients using the “explicit formula” of prime number theory. In this paper, the author obtains an arithmetic formula for corresponding coefficients associated with the Euler product of Hecke polynomials, which is essentially a product of L-functions attached to weight 2 cusp forms (both newforms and oldforms) over Hecke congruence subgroups Γ₀(N). The nonnegativity of these coefficients gives a criterion for the Riemann hypothesis for all these L-functions at once.     

A lower bound for the spectral radius of a digraph

We show that the spectral radius ρ(D) of a digraph D with n vertices and c₂ closed walks of length 2 satisfies Moreover, equality occurs if and only if D is the symmetric digraph associated to a -regular graph, plus some arcs that do not belong to cycles. As an application of this result, we construct new sharp upper bounds for the low energy of a digraph, which extends Koolen and Moulton bounds of the energy to digraphs.     

Generalized competition index of a primitive digraph

For positive integers k and m, and a digraph D, the k-step m-competition graph of D has the same set of vertices as D and an edge between vertices x and y if and only if there are distinct m vertices v₁,v₂,…,v_m in D such that there are directed walks of length k from x to v_i and from y to v_i for 1?i?m. In this paper, we present the definition of m-competition index for a primitive digraph. The m-competition index of a primitive digraph D is the smallest positive integer k such that is a complete graph. We study m-competition indices of primitive digraphs and provide an upper bound for the m-competition index of a primitive digraph.     

Omega theorems related to the general Euler totient function

We prove an omega estimate related to the general Euler totient function associated to a polynomial Euler product satisfying some natural analytic properties. For convenience, we work with a set of L-functions similar to the Selberg class, but in principle our results can be proved in a still more general setup. In a recent paper the authors treated a special case of Dirichlet L-functions with real characters. Greater generality of the present paper invites new technical difficulties. Effectiveness of the main theorem is illustrated by corollaries concerning Euler totient functions associated to the shifted Riemann zeta function, shifted Dirichlet L-functions and shifted L-functions of modular forms. Results are either of the same quality as the best known estimates or are entirely new.     

Vertex and edge PI indices of Cartesian product graphs

The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v. In this paper, the notion of vertex PI index of a graph is introduced. We apply this notion to compute an exact expression for the PI index of Cartesian product of graphs. This extends a result by Klavzar [On the PI index: PI-partitions and Cartesian product graphs, MATCH Commun. Math. Comput. Chem. 57 (2007) 573-586] for bipartite graphs. Some important properties of vertex PI index are also investigated.