On vertex-uniprimitive non-Cayley graphs of order pq

Abstract

Let p and q be distinct odd primes. Let =(V(), E()) be a non-Cayley vertex-transitive graph of order pq. Let G≤ () acts primitively on the vertex set V(). In this paper, we show that G is uniprimitive which is primitive but not 2-transitive and we obtain some information about p, q and the minimality of the Socle T=(G).

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…