Symmetric graphs of prime valency with a transitive simple group
Abstract
A graph =(V,E) is called a Cayley graph of some group T if the automorphism group () contains a subgroup T which acts on regularly on V. If the subgroup T is normal in () then is called a normal Cayley graph of T. Let r be an odd prime. Fang et al. FMW proved that, with a finite number of exceptions for finite simple group T, every connected symmetric Cayley graph of T of valency r is normal. In this paper, employing maximal factorizations of finite almost simple groups, we work out a possible list of those exceptions for T.
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.