Edge-transitive cyclic regular covers of the Möbius-Kantor graph
type: Item
instance of: scholarly article
title: Edge-transitive cyclic regular covers of the Möbius-Kantor graph
zbMATH Open document ID: 1233.05117
author: Jin-Xin Zhou
author: Yan-Quan Feng
published in: European Journal of Combinatorics
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5996452
zbMATH Keywords: abelian regular covers
zbMATH Keywords: cubic edge-transitive graphs
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: j.ejc.2011.09.034
OpenAlex ID: W2011821313
cites work: The Magma algebra system. I: The user language
cites work: An Edge but not Vertex Transitive Cubic Graph*
cites work: On edge but not vertex transitive regular graphs
cites work: Q4039906
cites work: Q4532739
cites work: A census of semisymmetric cubic graphs on up to 768 vertices
cites work: The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
cites work: On weakly symmetric graphs of order twice a prime
cites work: 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
cites work: On \(2\)-arc-transitive covers of complete graphs
cites work: A classification of semisymmetric graphs of order 2pq
cites work: One-regular cubic graphs of order a small number times a prime or a prime square
cites work: s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3
cites work: Classifying cubic symmetric graphs of order \(10p\) or \(10p^{2}\)
cites work: Cubic symmetric graphs of order a small number times a prime or a prime square
cites work: Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\)
cites work: \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\).
cites work: Semisymmetric graphs
cites work: Regular line-symmetric graphs
cites work: Q5625213
cites work: On finite simple groups of characteristic 2 type
cites work: Generating all graph coverings by permutation voltage assignments
cites work: Q4284648
cites work: Q3765805
cites work: Q3931423
cites work: An infinite series of regular edge- but not vertex-transitive graphs
cites work: Vertex-transitive graphs: Symmetric graphs of prime valency
cites work: A note on the generalized Petersen graphs that are also Cayley graphs
cites work: On semisymmetric cubic graphs of order \(6p^{2}\)
cites work: Group actions, coverings and lifts of automorphisms
cites work: Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
cites work: Elementary abelian covers of graphs
cites work: On cubic graphs admitting an edge-transitive solvable group
cites work: An infinite family of cubic edge- but not vertex-transitive graphs
cites work: Cubic edge-transitive graphs of order 2\(p^{3}\)
cites work: Invariant subspaces, duality, and covers of the Petersen graph
cites work: Constructing cubic edge- but not vertex-transitive graphs
cites work: Semisymmetry of generalized Folkman graphs
cites work: A classification of cubic \(s\)-regular graphs of order \(14p\)
cites work: A classification of cubic \(s\)-regular graphs of order 16\(p\)
cites work: Semisymmetric cubic graphs of twice odd order
cites work: On the Symmetry of Cubic Graphs
cites work: A worthy family of semisymmetric graphs
DOI: 10.1016/J.EJC.2011.09.034
description: scientific article; zbMATH DE number 5996452