A census of semisymmetric cubic graphs on up to 768 vertices

DOI10.1007/s10801-006-7397-3zbMath1089.05032OpenAlexW2146484561WikidataQ29036069 ScholiaQ29036069MaRDI QIDQ2494276

Aleksander Malnič, Dragan Marušič, Primož Potočnik, Marston D. E. Conder

Publication date: 26 June 2006

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-006-7397-3

zbMATH Keywords

AmalgamsEdge-transitive graphsSemisymmetric graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Semisymmetric graphs admitting primitive groups of degree \(9p\) ⋮ Flag-transitive block designs with automorphism group \(S_n w r S_2\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semisymmetric elementary Abelian covers of the Möbius-Kantor graph ⋮ Super-cyclically edge-connected regular graphs ⋮ Cubic edge-transitive graphs of order \(2^np\) ⋮ On split liftings with sectional complements ⋮ LDPC codes from cubic semisymmetric graphs ⋮ Semisymmetric cubic graphs of twice odd order ⋮ Classifying cubic edge-transitive graphs of order \(8p\) ⋮ Locally arc-transitive graphs of valence \(\{3,4\}\) with trivial edge kernel ⋮ Cubic edge-transitive bi-\(p\)-metacirculants ⋮ Semisymmetric graphs from polytopes ⋮ Semisymmetric elementary abelian covers of the Heawood graph ⋮ Symmetric graphs from polytopes of high rank ⋮ On some problems regarding distance-balanced graphs ⋮ Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap ⋮ Three local actions in 6‐valent arc‐transitive graphs ⋮ Semisymmetric graphs of order \(6p ^{2}\) and prime valency ⋮ Constructing flag-transitive incidence structures ⋮ Pentavalent semisymmetric graphs of square‐free order ⋮ Semisymmetric graphs of order twice prime powers with the same prime valency ⋮ A family of \(2\)-groups and an associated family of semisymmetric, locally \(2\)-arc-transitive graphs ⋮ On locally primitive graphs of order \(18p\) ⋮ CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p² ⋮ Edge-transitive bi-Cayley graphs ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ Recipes for edge-transitive tetravalent graphs ⋮ Affine primitive groups and semisymmetric graphs ⋮ Arc-transitive abelian regular covers of cubic graphs ⋮ Semisymmetric graphs of order \(2p^3\) ⋮ Linking rings structures and semisymmetric graphs: Combinatorial constructions ⋮ Some semisymmetric graphs arising from finite vector spaces ⋮ Edge-transitive cyclic regular covers of the Möbius-Kantor graph ⋮ ON THE CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER $58p2$ ⋮ Semisymmetric graphs ⋮ On edge-transitive cubic graphs of square-free order ⋮ Unnamed Item ⋮ Linking rings structures and semisymmetric graphs: Cayley constructions ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ Semisymmetric Zp-covers of the C20 graph ⋮ Four Constructions of Highly Symmetric Tetravalent Graphs ⋮ Locally Symmetric Graphs of Girth 4 ⋮ Semisymmetric cubic graphs of order \(16p^{2}\) ⋮ Elementary abelian covers of graphs ⋮ On cubic graphs admitting an edge-transitive solvable group ⋮ Distance-residual subgraphs ⋮ Edge-transitive regular \(Z_n\)-covers of the Heawood graph ⋮ A classification of semisymmetric graphs of order \(2p^3\): unfaithful case ⋮ Cubic semisymmetric graphs of order \(6p^{3}\) ⋮ Cubic semisymmetric graphs of order \(2qp^2\) ⋮ Distance-balanced graphs: symmetry conditions ⋮ Cubic graphs with most automorphisms ⋮ Edge-transitive graphs of small order and the answer to a 1967 question by Folkman ⋮ Some Topics in Graph Theory ⋮ On semisymmetric cubic graphs of order \(20p^2\), \(p\) prime ⋮ Classifying cubic semisymmetric graphs of order \(18p^n\) ⋮ New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces ⋮ Girth-regular graphs ⋮ A classification of cubic connected bi-dicirculants ⋮ Cubic edge-transitive bi-Cayley graphs over inner-abelian p-groups ⋮ Cubic semisymmetric graphs of order \(8p ^{3}\) ⋮ ON THE ORDER OF ARC-STABILIZERS IN ARC-TRANSITIVE GRAPHS ⋮ Some computational aspects of solvable regular covers of graphs ⋮ Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elementary abelian covers of graphs
• On cubic graphs admitting an edge-transitive solvable group
• A contribution to the theory of voltage graphs
• Regular groups of automorphisms of cubic graphs
• Biprimitive graphs of smallest order
• The Magma algebra system. I: The user language
• A worthy family of semisymmetric graphs
• Lifting graph automorphisms by voltage assignments
• Automorphism groups of symmetric graphs of valency 3
• An infinite family of cubic edge- but not vertex-transitive graphs
• Note on infinite families of trivalent semisymmetric graphs
• On edge but not vertex transitive regular graphs
• Characterizing finite locally s-arc transitive graphs with a star normal quotient
• A canonical representation of trivalent hamiltonian graphs
• A classification of semisymmetric graphs of order 2pq
• The Gray graph revisited
• Constructing cubic edge- but not vertex-transitive graphs
• An infinite series of regular edge- but not vertex-transitive graphs
• The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
• Regular line-symmetric graphs
• An Edge but not Vertex Transitive Cubic Graph^*
• Automorphisms of trivalent graphs
• Semisymmetry of generalized Folkman graphs