Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A

Abstract

AbstractArc-transitive and edge-transitive graphs are widely used in computer networks. Therefore, it is very useful to introduce and study the properties of these graphs. A graph [Formula: see text] can be called [Formula: see text]-edge-transitive (G-E-T) or [Formula: see text]-arc-transitive (G-A-T) if [Formula: see text] acts transitively on its edges or arc set, where [Formula: see text] respectively. A regular covering projection (C-P) [Formula: see text] is E-T or A-T if an E-R or A-T subgroup of [Formula: see text] lifts under [Formula: see text] In this paper, we first study all [Formula: see text]-elementary abelian (E-A) regular covers of Wreath graph [Formula: see text] and then investigate (E-T) regular [Formula: see text]-covers of the Foster graph [Formula: see text]

Keywords

• Invariant subspace
• A-T graphs
• Wreath graph W
• Foster graph F26A
• (A-T) C-P
• (E-T) C-P