English

On basic $2$-arc-transitive graphs

Combinatorics 2022-10-11 v2 Group Theory

Abstract

A connected graph Γ=(V,E)\Gamma=(V,E) of valency at least 33 is called a basic 22-arc-transitive graph if its full automorphism group has a subgroup GG with the following properties: (i) GG acts transitively on the set of 22-arcs of Γ\Gamma, and (ii) every minimal normal subgroup of GG has at most two orbits on VV. In her papers [17,18], Praeger proved a connected 22-arc-transitive graph of valency at least 33 is a normal cover of some basic 22-arc-transitive graph, and characterized the group-theoretic structures for basic 22-arc-transitive graphs. Based on Praeger's theorems on 22-arc-transitive graphs, this paper presents a further understanding on basic 22-arc-transitive graphs.

Keywords

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