Graph isomorphism
The simple graphs G1=(V1,E1) and G2=(E2,V2) are isomorphic iff
there is a bijection f from V1 to V2 with the property that a and b are
adjacent in G1 if and only if f(a) and f(b) are adjacent in G2, for all
Such a function f is called an isomorphism.