on vertex-uniprimitive non-cayley graphs of order pq

Let p and q be distinct odd primes. let γ = (v (γ),e(γ)) be a non-cayley vertextransitive graph of order pq. let g ≤ aut(γ) 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 = soc(g).