Semisymmetric elementary Abelian covers of the Möbius-Kantor graph

DOI10.1016/j.disc.2006.10.008zbMath1136.05026arXivmath/0510383OpenAlexW2164559720MaRDI QIDQ2643310

Štefko Miklavič, Primož Potočnik, Dragan Marušič, Aleksander Malnič

Publication date: 23 August 2007

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

Full work available at URL: https://arxiv.org/abs/math/0510383

zbMATH Keywords

graphinvariant subspaceshomology groupgroup representationmatrix groupcovering projectionlifting automorphisms

Mathematics Subject Classification ID

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

Related Items

Edge-transitive regular metacyclic covers of the Petersen graph ⋮ A classification of cubic symmetric graphs of order \(16p^2\) ⋮ Arc-transitive elementary abelian covers of the complete graph \(K_{5}\) ⋮ Semisymmetric elementary abelian covers of the Heawood graph ⋮ Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order \(2p\) ⋮ On cyclic regular covers of complete graphs of small order ⋮ Three local actions in 6‐valent arc‐transitive graphs ⋮ Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A ⋮ Arc-transitive abelian regular covers of cubic graphs ⋮ Semisymmetric graphs of order \(2p^3\) ⋮ Edge-transitive cyclic regular covers of the Möbius-Kantor graph ⋮ Semisymmetric graphs ⋮ Arc-transitive regular cyclic covers of the complete bipartite graph \(\mathsf{K}_{p,p}\) ⋮ Arc-transitive elementary Abelian covers of the octahedron graph ⋮ Semisymmetric Zp-covers of the C20 graph ⋮ Semisymmetric cubic graphs of order \(16p^{2}\) ⋮ On cubic graphs admitting an edge-transitive solvable group ⋮ 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\) ⋮ A classification of cubic \(s\)-regular graphs of order 16\(p\) ⋮ Cubic semisymmetric graphs of order \(8p ^{3}\) ⋮ Lifting a prescribed group of automorphisms of graphs ⋮ Arc-transitive elementary abelian covers of the Pappus graph ⋮ Some computational aspects of solvable regular covers of graphs

Uses Software

• GAP
• Magma

Cites Work

• 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
• 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
• Regular groups of automorphisms of cubic graphs
• A note on the generalized Petersen graphs that are also Cayley graphs
• The Magma algebra system. I: The user language
• Automorphisms of graphs and coverings
• Linear criteria for lifting automorphisms of elementary abelian regular coverings
• An infinite family of cubic edge- but not vertex-transitive graphs
• Invariant subspaces, duality, and covers of the Petersen graph
• A census of semisymmetric cubic graphs on up to 768 vertices
• s‐Regular cubic graphs as coverings of the complete bipartite graph K_3,3
• One-regular cubic graphs of order a small number times a prime or a prime square
• The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
• Automorphisms of trivalent graphs