In the mathematical field of graph theory, a graph G is symmetric if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of G, there is an automorphism f : V → V {\displaystyle f:V\rightarrow V} such that f = u 2 {\displaystyle f=u_{2}} and f = v 2. Wikipedia