학술논문
Elementary abelian covers of the wreath graph $W(3,2)$ and the Foster graph $F26A$.
Document Type
Journal
Author
Chen, Z. (PRC-GUAN-ICT) AMS Author Profile; Kosari, S. (PRC-GUAN-ICT) AMS Author Profile; Omidi, S. (IR-MEDU2-DED) AMS Author Profile; Mehdipoor, N. (IR-UMZ-M) AMS Author Profile; Talebi, A. A. (IR-UMZ-M) AMS Author Profile; Rashmanlou, H. (IR-UMZ-M) AMS Author Profile
Source
Subject
20 Group theory and generalizations -- 20B Permutation groups
20B25Finite automorphism groups of algebraic, geometric, or combinatorial structures
20B25
Language
English
Abstract
Summary: ``Arc-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 $\Upsilon$ can be called $G$-edge-transitive (G-E-T) or $G$-arc-transitive (G-A-T) if $G$ acts transitively on its edges or arc set, where $G\leqslant Aut(\Upsilon)$, respectively. A regular covering projection (C-P) $p :\overline\Upsilon\to\Upsilon$ is E-T or A-T if an E-R or A-T subgroup of $Aut(\Upsilon)$ lifts under $p$. In this paper, we first study all $p$-elementary abelian (E-A) regular covers of Wreath graph $W(2, 3)$ and then investigate (E-T) regular $\Bbb Z_p$-covers of the Foster graph $F26A$.''