How to find G-admissible abelian coverings of a graph?
Haimiao Chen, Hao Shen

TL;DR
This paper develops a general method to find all finite abelian regular coverings of a graph that admit a specific automorphism subgroup lift, and applies it to classify certain coverings of the Petersen graph.
Contribution
It introduces a new systematic approach for identifying G-admissible abelian coverings of graphs and classifies all such coverings for the Petersen graph.
Findings
Classified all connected arc-transitive abelian regular coverings of the Petersen graph.
Provided a general method for finding G-admissible abelian coverings of any finite connected simple graph.
Abstract
Given a finite connected simple graph , and a subgroup of its automorphism group, a general method for finding all finite abelian regular coverings of that admit a lift of each element of is developed. As an application, all connected arc-transitive abelian regular coverings of the Petersen graph are classified up to isomorphism.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
