On the automorphism groups of graphs with twice prime valency
Hong Ci Liao, Jing Jian Li, Zai Ping Lu

TL;DR
This paper classifies the automorphism groups of connected edge-transitive graphs with odd order and twice prime valency, showing they are either almost simple or affine primitive groups, with most socles acting transitively on edges.
Contribution
It provides a classification of automorphism groups for a specific class of graphs, extending understanding of their symmetry properties.
Findings
Automorphism groups are either almost simple or affine primitive.
Most socles of almost simple groups act transitively on edges.
Identifies two exceptions where socles do not act transitively.
Abstract
A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let be a connected graph of odd order and twice prime valency, and let be a subgroup of the automorphism group of . In the case where acts transitively on the edges and quasiprimitively on the vertices of , we prove that either is almost simple or is a primitive group of affine type. If further is an almost simple primitive group then, with two exceptions, the socle of acts transitively on the edges of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Cooperative Communication and Network Coding · Coding theory and cryptography
