On the weighted complexity of a regular covering of a graph

Authors:
Hirobumi Mizuno;Iwao Sato
Affiliations:
Department of Electronics and Computer Science, Meisei University, 2-590, Nagabuti, Ome, Tokyo 198-8655, Japan;Oyama National College of Technology, Oyama, Tochigi 323-0806, Japan
Venue:
Journal of Combinatorial Theory Series B
Year:
2003

Citing 3
Cited 1

Topological graph theory

Topological graph theory
A note on the zeta function of a graph

Journal of Combinatorial Theory Series B
Zeta functions of graph coverings

Journal of Combinatorial Theory Series B

Weighted complexities of graph products and bundles

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the weighted complexity of a graph G, and present a generalization of Northshield's Theorem on the complexity of G. Furthermore, we give an explicit formula for the weighted complexity of a regular covering H of G in terms of that of G and a product of determinants over the all distinct irreducible representations of the covering transformation group of H.