A class of semisymmetric graphs

Authors

  • Li Wang Capital Normal University, China and Henan Polytechnic University, China
  • Shaofei Du Capital Normal University, China
  • Xuewen Li Tangshan Normal University, China

DOI:

https://doi.org/10.26493/1855-3974.276.9a5

Keywords:

Permutation group, primitive group, vertex-transitive graph, semisymmetric graph

Abstract

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 2p3 are determined. This work is a partial result for our long term goal to classify all semisymmetric graphs of order 2p3.

Downloads

Published

2013-01-11

Issue

Vol. 7 No. 1 (2014)

Section

Special Issue Bled'11

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/