Publication:3931423
From MaRDI portal
zbMath0475.05041MaRDI QIDQ3931423
Publication date: 1981
20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Related Items
Semisymmetry of generalized Folkman graphs, Cycle regular graphs need not be transitive, Links between two semisymmetric graphs on 112 vertices via association schemes, Semisymmetric elementary abelian covers of the Heawood graph, Edge-transitive cyclic regular covers of the Möbius-Kantor graph, On cubic graphs admitting an edge-transitive solvable group, Cubic semisymmetric graphs of order \(6p^{3}\), Classifying cubic semisymmetric graphs of order \(18p^n\), Semisymmetric graphs, Edge-transitive regular \(Z_n\)-covers of the Heawood graph, Galois correspondence between permutation groups and cellular rings (association schemes), Biprimitive graphs of smallest order, A worthy family of semisymmetric graphs, An infinite family of semisymmetric graphs constructed from affine geometries, Cubic edge-transitive graphs of order 2\(p^{3}\), An infinite family of cubic edge- but not vertex-transitive graphs, Note on infinite families of trivalent semisymmetric graphs, Bridging semisymmetric and half-arc-transitive actions on graphs, A classification of semisymmetric graphs of order \(2p^3\): unfaithful case, A census of semisymmetric cubic graphs on up to 768 vertices, Application of electronic computers in the theory of substitution groups and its applications
