Semisymmetric elementary abelian covers of the Heawood graph
From MaRDI portal
Publication:607030
DOI10.1016/j.disc.2010.09.017zbMath1200.05106OpenAlexW2076263230MaRDI QIDQ607030
Publication date: 19 November 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.017
Related Items (3)
Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order \(2p\) ⋮ How to find \(G\)-admissible abelian regular coverings of a graph? ⋮ Lifting a prescribed group of automorphisms of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elementary abelian covers of graphs
- On cubic graphs admitting an edge-transitive solvable group
- Semisymmetric cubic graphs of twice odd order
- Semisymmetric graphs
- Semisymmetric cubic graphs as regular covers of \(K_{3,3}\)
- Group actions, coverings and lifts of automorphisms
- A worthy family of semisymmetric graphs
- Cubic edge-transitive graphs of order 2\(p^{3}\)
- Lifting graph automorphisms by voltage assignments
- An infinite family of cubic edge- but not vertex-transitive graphs
- A census of semisymmetric cubic graphs on up to 768 vertices
- On edge but not vertex transitive regular graphs
- Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
- On a Class of Fixed-Point-Free Graphs
- On the Symmetry of Cubic Graphs
- Vertex-transitive graphs: Symmetric graphs of prime valency
- Cubic symmetric graphs of order twice an odd prime-power
- Constructing cubic edge- but not vertex-transitive graphs
- An infinite series of regular edge- but not vertex-transitive graphs
- Regular line-symmetric graphs
- An Edge but not Vertex Transitive Cubic Graph*
- Automorphisms of trivalent graphs
- Semisymmetry of generalized Folkman graphs
This page was built for publication: Semisymmetric elementary abelian covers of the Heawood graph
