Peer-reviewedCC BY 4.0The Electronic Journal of Combinatorics
On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs
Abstract
A graph is called edge-primitive if its full automorphism group acts primitively on its edge set. In this paper, we give a complete classification of all types of finite edge-primitive $2$-arc-transitive Cayley graphs and bi-Cayley graphs.
Related
- On Arc-Transitive Regular Covers of Cubic Edge-Primitive Graphs
- On 2-Arc-Transitive Cayley Graphs of Nonabelian Characteristically Simple Groups
- Isomorphisms of abelian Cayley graphs with their natural edge-colouring
- Cubic edge-transitive graphs of order ℓ p2
- Primitive flag-transitive generalized quadrangles
BibTeX
@article{chen2026edgeprimitive,
title = {{On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs}},
author = {Hao Nan Chen and Jing Jian Li and Ji Cheng Ma and Hao Yu},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
month = nov,
doi = {10.37236/15130},
url = {https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p28},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs
AU - Hao Nan Chen
AU - Jing Jian Li
AU - Ji Cheng Ma
AU - Hao Yu
PY - 2026
DA - 2026/11/06
JO - The Electronic Journal of Combinatorics
DO - 10.37236/15130
UR - https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p28
AB - A graph is called edge-primitive if its full automorphism group acts primitively on its edge set. In this paper, we give a complete classification of all types of finite edge-primitive $2$-arc-transitive Cayley graphs and bi-Cayley graphs.
SN - 1077-8926
ER -