Finite common coverings of pairs of regular graphs
β Scribed by Dana Angluin; A Gardiner
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 188 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper addresses the question of determining, for a given graph G, all regular maps having G as their underlying graph, i.e., all embeddings of G in closed surfaces exhibiting the highest possible symmetry. We show that if G satisfies certain natural conditions, then all orientable regular embed
Galois theory for normal unramified coverings of finite irregular graphs (which may have multiedges and loops) is developed. Using Galois theory we provide a construction of intermediate coverings which generalizes the classical Cayley and Schreier graph constructions. Three different analogues of A
## Abstract A graph is __sβregular__ if its automorphism group acts freely and transitively on the set of __s__βarcs. An infinite family of cubic 1βregular graphs was constructed in [10], as cyclic coverings of the threeβdimensional Hypercube. In this paper, we classify the __s__βregular cyclic cov