A worthy family of semisymmetric graphs

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

Stephen E. Wilson

Publication date: 25 September 2003

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

zbMATH Keywords

symmetry; graph automorphism group

Mathematics Subject Classification ID

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

Related Items

Semisymmetric elementary abelian covers of the Heawood graph, Edge-transitive cyclic regular covers of the Möbius-Kantor graph, Elementary abelian covers of graphs, Cubic semisymmetric graphs of order \(6p^{3}\), Cubic semisymmetric graphs of order \(8p ^{3}\), Tetravalent edge-transitive graphs of girth at most 4, Semisymmetric graphs, Cubic edge-transitive graphs of order 2\(p^{3}\), An infinite family of cubic edge- but not vertex-transitive graphs, A classification of semisymmetric graphs of order \(2p^3\): unfaithful case, Semisymmetric graphs of order \(2p^3\), A census of semisymmetric cubic graphs on up to 768 vertices, Distance-balanced graphs: symmetry conditions

Cites Work

• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item