Checking for Graph Isomorphism

Before trying to verify isomorphism, we might want to try ruling out isomorphism first. If any of the following properties differ, the graphs cannot be isomorphic:

1. Number of vertices
2. Number of edges
3. Degree sequence
4. Number of connected components
5. Number of self-loops
6. Presence of cycles

If all these properties match, the graphs may be isomorphic.

Let's walk through this list and show some examples of graphs that aren't isomorphic.