Contents

Ars Combinatoria

  • Research article

Characteristic Polynomials of Covers of Symmetric Digraphs

Hirobumi Mizuno1, Iwao Sato2
1Department of Computer Science and Information Mathematics University of Electro-Communications 1-5-1, Chofugaoka, Chofu, Tokyo 182 Japan
2The Tsuruoka Technical College Tsuruoka, Yamagata 997 Japan
  • Published: 30/04/1997

Abstract

Let \(D\) be an asymmetric digraph and \(A\) a finite group. We give a formula for the characteristic polynomial of a cyclic \(A\)-cover of \(D\). This is a generalization of a formula for the characteristic polynomial of a regular covering of a graph. Furthermore, we discuss cyclic abelian covers of \(D\).

Citation
Hirobumi Mizuno, Iwao Sato. Characteristic Polynomials of Covers of Symmetric Digraphs[J], Ars Combinatoria, Volume 045. 3-12. .