in several equivalent ways:
*The automorphism group of the graph includes a cyclic subgroup that acts transitively on the graph's vertices. In other words, the graph has an automorphism which is a cyclic permutation of its vertices.
*The graph has an adjacency matrix