On basic $2$-arc-transitive graphs
Combinatorics
2022-10-11 v2 Group Theory
Abstract
A connected graph of valency at least is called a basic -arc-transitive graph if its full automorphism group has a subgroup with the following properties: (i) acts transitively on the set of -arcs of , and (ii) every minimal normal subgroup of has at most two orbits on . In her papers [17,18], Praeger proved a connected -arc-transitive graph of valency at least is a normal cover of some basic -arc-transitive graph, and characterized the group-theoretic structures for basic -arc-transitive graphs. Based on Praeger's theorems on -arc-transitive graphs, this paper presents a further understanding on basic -arc-transitive graphs.
Cite
@article{arxiv.2204.07382,
title = {On basic $2$-arc-transitive graphs},
author = {Zai Ping Lu and Ruo Yu Song},
journal= {arXiv preprint arXiv:2204.07382},
year = {2022}
}
Comments
10 pages