Arc-transitive pentavalent Cayley graphs with soluble vertex stabilizer on finite nonabelian simple groups
Bo Ling, Ben Gong Lou

TL;DR
This paper classifies connected arc-transitive pentavalent Cayley graphs with soluble vertex stabilizers on finite nonabelian simple groups, showing most are normal except for specific cases, and constructs a novel example on _{79}.
Contribution
It proves the normality of such Cayley graphs except for two specific alternating groups and constructs the first known non-normal example on _{79}.
Findings
Most such graphs are normal.
Two exceptions are _{39} and _{79}.
Constructed a non-normal 3-arc-transitive Cayley graph on _{79}.
Abstract
A Cayley graph is said to be normal if is normal in . The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the full automorphism groups of Cayley graphs. In this paper, we investigate the normality problem of the connected arc-transitive pentavalent Cayley graphs with soluble vertex stabilizer on finite nonabelian simple groups. We prove that all such graphs are either normal or or . Further, a connected arc-transitive pentavalent Cayley graph on is constructed. To our knowledge, this is the first known example of pentavalent 3-arc-transitive Cayley graph on finite nonabelian simple group which is non-normal.
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 · graph theory and CDMA systems · Coding theory and cryptography
