3.Next

In the mathematical field of graph theory, a graph is symmetric or arc-transitive if, given any two ordered pairs of adjacent vertices and of , there is an automorphism

:

such that

: and

In other words, a graph is symmetric if its automorphism group

3.Next