Graph Automorphisms

graph

AGraph

2 automorphisms:

{{1,2,3,4,5,6},{6,5,4,3,2,1}}

An automorphism of a graph is a graph isomorphism with itself, that is, a mapping from the vertices of the given graph

G

back to vertices of

G

such that the resulting graph is isomorphic with

G

. This Demonstration enumerates the automorphisms of some small simple graphs.