Papers
Topics
Authors
Recent
Search
2000 character limit reached

On basic $2$-arc-transitive graphs

Published 15 Apr 2022 in math.CO and math.GR | (2204.07382v2)

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

Citations (2)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.