A class of semisymmetric graphs. (English) Zbl 1301.05091
Summary: A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. Let \( p \) be a prime. In this paper, a class of semisymmetric graphs of order \(2 p ^3\) is determined. This work is a partial result for our long term goal to classify all semisymmetric graphs of order \(2 p ^3\).
MSC:
| 05C10 | Planar graphs; geometric and topological aspects of graph theory |
| 05C25 | Graphs and abstract algebra (groups, rings, fields, etc.) |
| 20B25 | Finite automorphism groups of algebraic, geometric, or combinatorial structures |
