Classification of tetravalent 2-transitive non-normal Cayley graphs of finite simple groups
Abstract
A graph is called (G, s)-arc-transitive if G Aut() is transitive on the set of vertices of and the set of s-arcs of , where for an integer s 1 an s-arc of is a sequence of s+1 vertices (v0,v1,…,vs) of such that vi-1 and vi are adjacent for 1 i s and vi-1 vi+1 for 1 i s-1. is called 2-transitive if it is (Aut(), 2)-arc-transitive but not (Aut(), 3)-arc-transitive. A Cayley graph of a group G is called normal if G is normal in 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 G, then either is normal or G is one of the groups PSL2(11), M11, M23 and A11. However, it was unknown whether is normal when G is one of these four groups. In the present paper we answer this question by proving that among these four groups only M11 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.