In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization,of the complete bipartite graph $K_{p^{sp^t},p^{sp^t}}$ into connected semisymmetric graphs, where $p$ is an prime, $1\le t\le s$ with $s\ge2$ while $p=2$.
@article{10_37236_2549,
author = {Hua Han and Zaiping Lu},
title = {Affine primitive groups and semisymmetric graphs},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {2},
doi = {10.37236/2549},
zbl = {1266.05056},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2549/}
}
TY - JOUR
AU - Hua Han
AU - Zaiping Lu
TI - Affine primitive groups and semisymmetric graphs
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/2549/
DO - 10.37236/2549
ID - 10_37236_2549
ER -
%0 Journal Article
%A Hua Han
%A Zaiping Lu
%T Affine primitive groups and semisymmetric graphs
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2549/
%R 10.37236/2549
%F 10_37236_2549
Hua Han; Zaiping Lu. Affine primitive groups and semisymmetric graphs. The electronic journal of combinatorics, Tome 20 (2013) no. 2. doi: 10.37236/2549
