On the weighted complexity of a regular covering of a graph

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.