3A permutation ψ on a set W is naturally extended to a graph isomorphism on graphs G = (W,E) by defining
ψ(G) = (W,F), where F = {(ψ(u),ψ(v))∣(u,v) 
E}.
3A permutation ψ on a set W is naturally extended to a graph isomorphism on graphs G = (W,E) by defining
ψ(G) = (W,F), where F = {(ψ(u),ψ(v))∣(u,v) E}.