Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

117

Voted

COMBINATORICS
2006

144views more COMBINATORICS 2006»

Weighted Zeta Functions of Graph Coverings

15 years 2 months ago

Weighted Zeta Functions of Graph Coverings

Download www.maths.tcd.ie

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.

Iwao Sato

Real-time Traffic

COMBINATORICS 2006 | Decomposition Formula | Weighted L-functions | Weighted Zeta Function |

claim paper

Related Content

» Covering and Packing in Linear Space

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

» Trimmed Moebius Inversion and Graphs of Bounded Degree

» A PrimalDual Approximation Algorithm for Partial Vertex Cover Making Educated Guesses

» Admission control to minimize rejections and online set cover with repetitions

» A MinMax Relation on Packing Feedback Vertex Sets

» Bounded Size Graph Clustering with Applications to Stream Processing

» Approximation Algorithms for MultiCriteria Traveling Salesman Problems

» Optimalstretch nameindependent compact routing in doubling metrics

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	Iwao Sato

Comments (0)