Edge-transitive cyclic regular covers of the Möbius-Kantor graph
From MaRDI portal
(Redirected from Publication:657997)
Recommendations
- Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2p
- Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
- Edge-transitive regular \(Z_n\)-covers of the Heawood graph
- Edge-transitive regular metacyclic covers of the Petersen graph
- On cyclic regular covers of complete graphs of small order
Cites work
- scientific article; zbMATH DE number 4023321 (Why is no real title available?)
- scientific article; zbMATH DE number 3745208 (Why is no real title available?)
- scientific article; zbMATH DE number 193034 (Why is no real title available?)
- scientific article; zbMATH DE number 524160 (Why is no real title available?)
- scientific article; zbMATH DE number 1750091 (Why is no real title available?)
- scientific article; zbMATH DE number 3349883 (Why is no real title available?)
- 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
- s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3
- A census of semisymmetric cubic graphs on up to 768 vertices
- A classification of cubic \(s\)-regular graphs of order 16\(p\)
- A classification of cubic \(s\)-regular graphs of order \(14p\)
- A classification of semisymmetric graphs of order 2pq
- A note on the generalized Petersen graphs that are also Cayley graphs
- A worthy family of semisymmetric graphs
- An Edge but not Vertex Transitive Cubic Graph*
- An infinite family of cubic edge- but not vertex-transitive graphs
- An infinite series of regular edge- but not vertex-transitive graphs
- Classifying cubic symmetric graphs of order \(10p\) or \(10p^{2}\)
- Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\)
- Constructing cubic edge- but not vertex-transitive graphs
- Cubic edge-transitive graphs of order 2\(p^{3}\)
- Cubic symmetric graphs of order a small number times a prime or a prime square
- Elementary abelian covers of graphs
- Generating all graph coverings by permutation voltage assignments
- Group actions, coverings and lifts of automorphisms
- Invariant subspaces, duality, and covers of the Petersen graph
- On \(2\)-arc-transitive covers of complete graphs
- On cubic graphs admitting an edge-transitive solvable group
- On edge but not vertex transitive regular graphs
- On finite simple groups of characteristic 2 type
- On semisymmetric cubic graphs of order \(6p^{2}\)
- On the Symmetry of Cubic Graphs
- On weakly symmetric graphs of order twice a prime
- One-regular cubic graphs of order a small number times a prime or a prime square
- Regular line-symmetric graphs
- Semisymmetric cubic graphs of twice odd order
- Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
- Semisymmetric graphs
- Semisymmetry of generalized Folkman graphs
- The Magma algebra system. I: The user language
- The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
- Vertex-transitive graphs: Symmetric graphs of prime valency
- \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\).
Cited in
(6)- Symmetric cubic graphs with non-solvable automorphism groups
- Cubic edge-transitive graphs of order 2ⁿp
- Edge-transitive regular metacyclic covers of the Petersen graph
- Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2p
- Edge-transitive regular \(Z_n\)-covers of the Heawood graph
- Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
This page was built for publication: Edge-transitive cyclic regular covers of the Möbius-Kantor graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657997)
