Note on Infinite Families of Trivalent Semisymmetric Graphs

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL (2, p) and PGL (2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs.