English

On vertex-uniprimitive non-Cayley graphs of order pq

Group Theory 2014-07-18 v1 Combinatorics

Abstract

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

Keywords

Cite

@article{arxiv.1407.4771,
  title  = {On vertex-uniprimitive non-Cayley graphs of order pq},
  author = {Mohammad A. Iranmanesh},
  journal= {arXiv preprint arXiv:1407.4771},
  year   = {2014}
}

Comments

5 pages