A classification of semisymmetric graphs of order 2pq
Authors:
- 1 January 2000
- journal article
- research article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 28 (6) , 2685-2715
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- Biprimitive Graphs of Smallest OrderJournal of Algebraic Combinatorics, 1999
- Permutation Groups1996
- A classification of the maximal subgroups of the finite alternating and symmetric groupsJournal of Algebra, 1987
- On weakly symmetric graphs of order twice a primeJournal of Combinatorial Theory, Series B, 1987
- Classification of 2-transitive symmetric designsGraphs and Combinatorics, 1985
- Primitive Permutation Groups Containing an Element of Large Prime OrderJournal of the London Mathematical Society, 1985
- Finite Permutation Groups and Finite Simple GroupsBulletin of the London Mathematical Society, 1981
- On edge but not vertex transitive regular graphsJournal of Combinatorial Theory, Series B, 1972
- An Edge but not Vertex Transitive Cubic Graph*Canadian Mathematical Bulletin, 1968
- Regular line-symmetric graphsJournal of Combinatorial Theory, 1967