Classification of tetravalent 22-transitive non-normal Cayley graphs of finite simple groups

preprint2021arXivOpen access

Abstract

A graph ΓΓ is called (G,s)(G, s)-arc-transitive if G≤Aut(Γ)G \le \mathrm{Aut}(Γ) is transitive on the set of vertices of ΓΓ and the set of ss-arcs of ΓΓ, where for an integer s≥1s \ge 1 an ss-arc of ΓΓ is a sequence of s+1s+1 vertices (v0,v1,…,vs)(v_0,v_1,\ldots,v_s) of ΓΓ such that vi−1v_{i-1} and viv_i are adjacent for 1≤i≤s1 \le i \le s and vi−1≠vi+1v_{i-1}\ne v_{i+1} for 1≤i≤s−11 \le i \le s-1. ΓΓ is called 2-transitive if it is (Aut(Γ),2)(\mathrm{Aut}(Γ), 2)-arc-transitive but not (Aut(Γ),3)(\mathrm{Aut}(Γ), 3)-arc-transitive. A Cayley graph ΓΓ of a group GG is called normal if GG is normal in Aut(Γ)\mathrm{Aut}(Γ) and non-normal otherwise. It was proved by X. G. Fang, C. H. Li and M. Y. Xu that if ΓΓ is a tetravalent 2-transitive Cayley graph of a finite simple group GG, then either ΓΓ is normal or GG is one of the groups PSL2(11)\mathrm{PSL}_2(11), M11M_{11}, M23M_{23} and A11A_{11}. However, it was unknown whether ΓΓ is normal when GG is one of these four groups. In the present paper we answer this question by proving that among these four groups only M11M_{11} produces connected tetravalent 2-transitive non-normal Cayley graphs. We prove further that there are exactly two such graphs which are non-isomorphic and both determined in the paper. As a consequence, the automorphism group of any connected tetravalent 2-transitive Cayley graph of any finite simple group is determined.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.