Checking for Graph Isomorphism
In simple words, the definition of Isomorphism means that:
- Every vertex in \(G_1\) is matched with exactly one vertex in \(G_2\).
- Every edge in \(G_1\) must correspond to an edge in \(G_2\).
- Every non-edge in \(G_1\) must correspond to a non-edge in \(G_2\).
- The structure must remain unchanged.
We will now show that the following two graphs are isomorphic:
The graph $G_1$. Miriam Briskman, CC BY-NC 4.0.
The graph $G_2$. Miriam Briskman, CC BY-NC 4.0.
These notes by Miriam Briskman are licensed under CC BY-NC 4.0 and based on sources.