Edge-primitive graphs of order a product of three primes
摘要
A graph is said to be edge-primitive if it admits a group of automorphisms that acts primitively on its edge set. The study of edge-primitive graphs often involves examining such graphs with almost simple groups of automorphisms. Primitive groups of degree a product of three primes encompass a wide range of almost simple primitive groups. In this work, we classified edge-primitive graphs of order a product of three primes. The resulting graphs include two infinite families of edge-primitive graphs which are not 2-arc-transitive.