Semisymmetric cubic graphs of twice odd order

Authors:
C. W. Parker
Affiliations:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK
Venue:
European Journal of Combinatorics
Year:
2007

Citing 7
Cited 2

Cubic graphs with large girth

Proceedings of the third international conference on Combinatorial mathematics
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Completions of Goldschmidt Amalgams of Type G4 in Dimension 3

Journal of Algebraic Combinatorics: An International Journal
Note on infinite families of trivalent semisymmetric graphs

European Journal of Combinatorics
An infinite family of semisymmetric graphs constructed from affine geometries

European Journal of Combinatorics
An infinite family of biprimitive semisymmetric graphs

Journal of Graph Theory
Constructing cubic edge- but not vertex-transitive graphs

Journal of Graph Theory

Edge-transitive cyclic regular covers of the Möbius-Kantor graph

European Journal of Combinatorics
Semisymmetric graphs of order 2p3

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Connected cubic graphs @C of twice odd order which admit an automorphism group acting semisymmetrically are investigated. The structure of the automorphism group of @C modulo a subgroup which acts semiregularly on @C is determined. This identification is achieved by using the fundamental theorem of Goldschmidt [D.M. Goldschmidt, Automorphisms of trivalent graphs, Ann. of Math. (2) 111 (2) (1980) 377-406] and some small parts of the proof of the classification of the finite simple groups.