Просмотр кода страницы Vertex-symmetric graph

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

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