SMALLEST GRAPHS WITH A GIVEN CYCLIC GROUP

摘要

Let α(n) be the least number of vertices for which a graph has automorphism group isomorphic to c(n), the cyclic group of order n. We say a graph is the smallest graph with c(n) if Aut G c(n) and |V(G)| = a(n). In this letter we shall construct the smallest graph with c(n). For n=3,4,5 and p^t(p≥7, p is prime), the smallest graph with c(n) has been constructed. To construct the smal-