Weighted zeta functions of graphs
نویسندگان
چکیده
We define a weighted zeta function of a digraph and a weighted L-function of a symmetric digraph, and give determinant expressions of them. Furthermore, we give a decomposition formula for the weighted zeta function of a g-cyclic -cover of a symmetric digraph for any finite group and g ∈ . A decomposition formula for the weighted zeta function of an oriented line graph L(G̃) of a regular covering G̃ of a graph G is given. Furthermore, we define a weighted L-function of an oriented line graph L(G) of G, and present a factorization formula for the weighted zeta function of L(G̃) by weighted L-functions of L(G). As a corollay, we obtain a factorization formula for the multiedge zeta function of G̃ given by Stark and Terras. © 2002 Elsevier Science Inc. All rights reserved. AMS classification: 05C50; 05C25; 05C10; 15A15; 11F72
منابع مشابه
What are zeta functions of graphs and what are they good for ? Matthew
We discuss zeta functions of finite irregular undirected connected graphs (which may be weighted) and apply them to obtain, for example an analog of the prime number theorem for cycles in graphs. We consider 3 types of zeta functions of graphs: vertex, edge, and path. Analogs of the Riemann hypothesis are also introduced.
متن کاملWeighted Bartholdi zeta functions of graphs
We define the weighted Bartholdi zeta function of a graph G, and give a determinant expression of it. Furthermore, we define a weighted L-function of G, and present a determinant expression for the weighted L-function of G. As a corollary, we show that the weighted Bartholdi zeta function of a regular covering of G is a product of weighted L-functions of G. © 2005 Elsevier Ltd. All rights reser...
متن کاملWeighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighted zeta function of an (irregular or regular) covering of a graph by equivalence classes of prime, reduced cycles of the base graph. As an application, we discuss the structure of balanced coverings of signed graphs.
متن کاملZeta Functions of Weighted Graphs and Covering Graphs
We nd a condition for weights on the edges of a graph which insures that the Ihara zeta function has a 3-term determinant formula. Then we investigate the locations of poles of abelian graph coverings and compare the results with random covers. We discover that the zeta function of the random cover satis es an approximate Riemann hypothesis while that of the abelian cover does not.
متن کاملThe Weighted Complexity and the Determinant Functions of Graphs
Abstract. The complexity of a graph can be obtained as a derivative of a variation of the zeta function [J. Combin. Theory Ser. B, 74 (1998), pp. 408–410] or a partial derivative of its generalized characteristic polynomial evaluated at a point [arXiv:0704.1431[math.CO]]. A similar result for the weighted complexity of weighted graphs was found using a determinant function [J. Combin. Theory Se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 91 شماره
صفحات -
تاریخ انتشار 2004