Of Order 12, 20 Symmetric Graph Classification

Let Γbe a simple undirected graph and G a subgroup of Aut(Γ). Γ is said to be G-ymmetric if G acts transitively on the set of ordered adjacent pairs of vertices of Γ. Γ is said to be symmetric if it is Aut( Γ)ymmetric. In this paper we give a classification for symmetric graphs of order 12,20.