Vertex transitive graph

Vertex transitive graph --- вершинно-транзитивный граф.

A digraph or graph is vertex transitive, if for every pair of vertices [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math] there is an automorphism that maps [math]\displaystyle{ i }[/math] to [math]\displaystyle{ j }[/math].