On several symmetry conditions for graphs

AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitivity and symmetry of graphs, especially the relationships among them. We first give an equivalent condition for a graph to be vertex-transitive. Then we show that there is an infinite class of graphs whose edge-transitivity is equivalent to symmetry. Also we shall give a positive answer to a special case of a question by Holton