English

How to find G-admissible abelian coverings of a graph?

Combinatorics 2024-02-27 v1

Abstract

Given a finite connected simple graph Γ\Gamma, and a subgroup GG of its automorphism group, a general method for finding all finite abelian regular coverings of Γ\Gamma that admit a lift of each element of GG is developed. As an application, all connected arc-transitive abelian regular coverings of the Petersen graph are classified up to isomorphism.

Keywords

Cite

@article{arxiv.1303.3794,
  title  = {How to find G-admissible abelian coverings of a graph?},
  author = {Haimiao Chen and Hao Shen},
  journal= {arXiv preprint arXiv:1303.3794},
  year   = {2024}
}

Comments

24 pages, 1 figure