Vertex-symmetric graph

Vertex-symmetric graph --- вершинно-симметричный граф.

A graph [math]\displaystyle{ G = (V,E) }[/math] is a vertex-symmetric graph if the group of graph automorphisms [math]\displaystyle{ A(G) }[/math] acts transitively on [math]\displaystyle{ V }[/math], i.e. for any two vertices [math]\displaystyle{ v,w \in V }[/math] there is a graph automorphism [math]\displaystyle{ \alpha \in A(G) }[/math] with [math]\displaystyle{ \alpha(v) = w }[/math]. Cayley graphs are vertex-symmetric.