A simple undirected graph is said to be semisymmetric, if it is regular and edge-transitive but not vertex-transitive. In this talk we give a group-theoretic characterization of semisymmetric graphs. Some new results about such graphs are also mentioned.