A graph X is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(X) acting transitively on its edge set but not on its vertex set. In the case of G = A, we call X a semisymmetric graph. Finding elementary abelian covering projections can be grasped combinatorially via a linear representation of automorphisms acting on the first homology group of the graph. The method essentially reduces to finding invariant subspaces of matrix groups over prime fields. In this study, by applying concept linear algebra, we classify the connected semisymmetric zp-covers of the C20 graph.
