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