Graph Isomorphism

One-to-one mapping between two Graphs. Also called edge-preserving Bijection.

Necessary Condition for Isomorphism

The Ordered Degree Sequence of the two graphs are equal.