| A regular graphΓis called a G-semisymmetric graph, If G is edge-transtive butnot vertex-transtive, for G≤Aut(Γ). In particular,we callΓa semisymmetric graph ifG = Aut(Γ). In this paper, we discuss the Zpq×Zp-Regular coverings of K3,3, and a newinfinite family of semisymmetric graphs as the covering graphs of K3,3 by Zpq×Zp areconstructed, where p and q are primes and p,q≥127. |