A contribution to the theory of voltage graphs
Discrete Mathematics
Topological graph theory
Automorphism groups of symmetric graphs of valency 3
Journal of Combinatorial Theory Series B - Series B
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
Biprimitive Graphs of Smallest Order
Journal of Algebraic Combinatorics: An International Journal
Lifting graph automorphisms by voltage assignments
European Journal of Combinatorics
Semisymmetry of generalized Folkman graphs
European Journal of Combinatorics
Note on infinite families of trivalent semisymmetric graphs
European Journal of Combinatorics
On Cubic Graphs Admitting an Edge-Transitive Solvable Group
Journal of Algebraic Combinatorics: An International Journal
Elementary Abelian Covers of Graphs
Journal of Algebraic Combinatorics: An International Journal
Journal of Graph Theory
Constructing cubic edge- but not vertex-transitive graphs
Journal of Graph Theory
An infinite series of regular edge- but not vertex-transitive graphs
Journal of Graph Theory
The edge-transitive but not vertex-transitive cubic graph on 112 vertices
Journal of Graph Theory
Tetravalent edge-transitive graphs of girth at most 4
Journal of Combinatorial Theory Series B
Semisymmetric graphs from polytopes
Journal of Combinatorial Theory Series A
G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
Discrete Applied Mathematics
Edge-transitive cyclic regular covers of the Möbius-Kantor graph
European Journal of Combinatorics
Links between two semisymmetric graphs on 112 vertices via association schemes
Journal of Symbolic Computation
Four Constructions of Highly Symmetric Tetravalent Graphs
Journal of Graph Theory
Super-cyclically edge-connected regular graphs
Journal of Combinatorial Optimization
Locally arc-transitive graphs of valence {3,4} with trivial edge kernel
Journal of Algebraic Combinatorics: An International Journal
Semisymmetric graphs of order 2p3
European Journal of Combinatorics
Hi-index | 0.00 |
A list is given of all semisymmetric (edge- but not vertex-transitive) connected finite cubic graphs of order up to 768. This list was determined by the authors using Goldschmidt's classification of finite primitive amalgams of index (3,3), and a computer algorithm for finding all normal subgroups of up to a given index in a finitely-presented group. The list includes several previously undiscovered graphs. For each graph in the list, a significant amount of information is provided, including its girth and diameter, the order of its automorphism group, the order and structure of a minimal edge-transitive group of automorphisms, its Goldschmidt type, stabiliser partitions, and other details about its quotients and covers. A summary of all known infinite families of semisymmetric cubic graphs is also given, together with explicit rules for their construction, and members of the list are identified with these. The special case of those graphs having K1,3 as a normal quotient is investigated in detail.