2000 character limit reached
Lifting graph automorphisms along solvable regular covers
Published 19 Sep 2012 in math.GT | (1209.4283v5)
Abstract: A {\em solvable} cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given automorphism of the base graph of a solvable cover can be decomposed into layers of lifts of the automorphism in the layers of the abelian covers. This procedure is applied to classify metacyclic covers of the tetrahedron branched at face-centers.
Paper Prompts
Sign up for free to create and run prompts on this paper.