A worthy family of semisymmetric graphs

DOI10.1016/S0012-365X(03)00048-7zbMath1021.05048OpenAlexW2079084052MaRDI QIDQ1408884

Stephen E. Wilson

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00048-7

zbMATH Keywords

symmetrygraph automorphism group

Mathematics Subject Classification ID

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

Related Items (21)

Semisymmetric graphs admitting primitive groups of degree \(9p\) ⋮ Tetravalent edge-transitive graphs of girth at most 4 ⋮ Semisymmetric elementary abelian covers of the Heawood graph ⋮ Semisymmetric graphs of order twice prime powers with the same prime valency ⋮ Semisymmetric graphs of order \(2p^3\) ⋮ Cubic edge-transitive graphs of order 2\(p^{3}\) ⋮ Some semisymmetric graphs arising from finite vector spaces ⋮ Edge-transitive cyclic regular covers of the Möbius-Kantor graph ⋮ Semisymmetric graphs ⋮ Distance magic labeling and two products of graphs ⋮ Vertex-transitive direct products of graphs ⋮ Elementary abelian covers of graphs ⋮ A classification of semisymmetric graphs of order \(2p^3\): unfaithful case ⋮ Cubic semisymmetric graphs of order \(6p^{3}\) ⋮ A census of semisymmetric cubic graphs on up to 768 vertices ⋮ Cubic semisymmetric graphs of order \(2qp^2\) ⋮ Distance-balanced graphs: symmetry conditions ⋮ Edge-transitive graphs of small order and the answer to a 1967 question by Folkman ⋮ Semisymmetric prime-valent graphs of order \(2p^3\) ⋮ Cubic semisymmetric graphs of order \(8p ^{3}\) ⋮ An infinite family of cubic edge- but not vertex-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Associative products of graphs
• Biprimitive graphs of smallest order
• On edge but not vertex transitive regular graphs
• The Kronecker Product of Graphs
• Semi-transitive graphs
• A classification of semisymmetric graphs of order 2pq
• The Gray graph revisited
• Constructing cubic edge- but not vertex-transitive graphs
• An infinite family of biprimitive semisymmetric graphs
• Regular line-symmetric graphs
• The Categorical Product of Graphs
• An Edge but not Vertex Transitive Cubic Graph^*
• 25 pretty graph colouring problems
• Semisymmetry of generalized Folkman graphs

This page was built for publication: A worthy family of semisymmetric graphs