A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper gives a classification of semisymmetric graphs of order 2pq where p and q are distinct primes. It is shown that there are 143 examples of such graphs, 131 of which are biprimitive. [References: 24]
展开▼
