Semisymmetric graphs
DOI10.1016/J.DISC.2007.07.096zbMATH Open1147.05039OpenAlexW2266849731MaRDI QIDQ932665FDOQ932665
Authors: Jin-Xin Zhou, Yan-Quan Feng
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.096
Recommendations
automorphism groupgeneralized Petersen grapharc-transitive graphcovering graphsemisymmetric graphMöbius-Kantor graph
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
- Title not available (Why is that?)
- On \(2\)-arc-transitive covers of complete graphs
- Lifting graph automorphisms by voltage assignments
- On the Symmetry of Cubic Graphs
- Title not available (Why is that?)
- 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}\)
- \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\).
- Invariant subspaces, duality, and covers of the Petersen graph
- Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
- Title not available (Why is that?)
- An infinite series of regular edge- but not vertex-transitive graphs
- Group actions, coverings and lifts of automorphisms
- Vertex-transitive graphs: Symmetric graphs of prime valency
- Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\)
- A census of semisymmetric cubic graphs on up to 768 vertices
- One-regular cubic graphs of order a small number times a prime or a prime square
- Cubic edge-transitive graphs of order 2\(p^{3}\)
- An infinite family of cubic edge- but not vertex-transitive graphs
- s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3
- On edge but not vertex transitive regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular line-symmetric graphs
- An Edge but not Vertex Transitive Cubic Graph*
- Semisymmetry of generalized Folkman graphs
- Semisymmetric cubic graphs of twice odd order
- A worthy family of semisymmetric graphs
- Title not available (Why is that?)
- Constructing cubic edge- but not vertex-transitive graphs
Cited In (11)
- Edge-transitive cyclic regular covers of the Möbius-Kantor graph
- Semisymmetric elementary abelian covers of the Heawood graph
- Semisymmetric cubic graphs of order \(16p^{2}\)
- Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order \(2p\)
- Semisymmetry of generalized Folkman graphs
- Cubic semisymmetric graphs of order \(2qp^2\)
- Semisymmetric graphs of order twice prime powers with the same prime valency
- Cubic semisymmetric graphs of order \(8p ^{3}\)
- Cubic semisymmetric graphs of order \(6p^{3}\)
- Segre's hemisystem and McLaughlin's graph
- Semisymmetric \(Z_p\)-covers of the \(C20\) graph
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)