Semisymmetric graphs
In a recent paper in [Discrete Math. 307, No. 17--18, 2156--2175 (2007; Zbl 1136.05026)], \textit{A. Malnič, D. Marušič, S. Miklavič} and \textit{P. Potočnik} gave constructions for all pairwise non-isomorphic minimal semisymmetric elementary abelian covers of the Möbius-Kantor graph -- a 16-vertex 3-valent arc-transitive graph, known also as the generalized Petersen graph GP\((8,3)\). The automorphism group of this graph has a rich subgroup structure, making the problem of finding covers considerably more complex than, say, covers of the Petersen graph or the Heawood graph. It was remarked at the end of that paper that the minimal covering graphs arising from the given constructions need not always be semisymmetric. In this paper, it is shown that they are never arc-transitive, and so are always semisymmetric.
- 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
- \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\).
- A census of semisymmetric cubic graphs on up to 768 vertices
- 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 \(8p\) or \(8p^2\)
- Constructing cubic edge- but not vertex-transitive graphs
- Cubic edge-transitive graphs of order 2\(p^{3}\)
- Elementary abelian covers of graphs
- Group actions, coverings and lifts of automorphisms
- scientific article; zbMATH DE number 4023321 (Why is no real title available?)
- scientific article; zbMATH DE number 3739805 (Why is no real title available?)
- scientific article; zbMATH DE number 3745208 (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 3046496 (Why is no real title available?)
- Invariant subspaces, duality, and covers of the Petersen graph
- Lifting graph automorphisms by voltage assignments
- 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 the Symmetry of Cubic Graphs
- 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
- Semisymmetry of generalized Folkman graphs
- Vertex-transitive graphs: Symmetric graphs of prime valency
- Cubic semisymmetric graphs of order 2qp^2
- Segre's hemisystem and McLaughlin's graph
- Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2p
- Semisymmetric \(Z_p\)-covers of the \(C20\) graph
- Semisymmetry of generalized Folkman graphs
- Semisymmetric elementary abelian covers of the Heawood graph
- Semisymmetric graphs of order twice prime powers with the same prime valency
- Edge-transitive cyclic regular covers of the Möbius-Kantor graph
- Edge-transitive cubic graphs: analysis, cataloguing and enumeration
- Cubic semisymmetric graphs of order \(6p^{3}\)
- On s-flag-transitive designs and semisymmetric graphs
- Cubic semisymmetric graphs of order \(8p ^{3}\)
- Semisymmetric cubic graphs of order \(16p^{2}\)
This page was built for publication: Semisymmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932665)
