Isomorphism and Bijection

Isomorphism

If G1 = (V1, E1) and G2 = (V2, E2) are two graphs, then G1 is isomorphic to G2 iff (if and only if) there exists a bijection.

Bijection

Bijection is a function that associates every node in V1 with a unique node in V2 and vice versa.

Fig: Graph Isomorphism