Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424110 | European Journal of Combinatorics | 2016 | 14 Pages |
Abstract
A 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Haimiao Chen, Jin Ho Kwak,