Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.