Skip to main content

Section 5.3 Graph Isomorphism

When calculating properties of the graphs in Figure 5.2.43 and Figure 5.2.44, you may have noted that some of the graphs shared many properties. It should also be apparent that a given graph can be drawn in many different ways given that the relative location of vertices and shape of edges is irrelevant. If two graphs are essentially the same, they are called isomorphic.

Definition 5.3.1. Graph Isomorphism.

Two graphs \(G=(V_G,E_G)\) and \(H=(V_H,E_H)\) are isomorphic if and only if there exists a Bijection, called the isomorphism, \(f:V_G \to V_H\) such that \(\{v_1,v_2\} \in E_G\) if and only if \(\{f(v_1),f(v_2)\} \in E_H.\)

Example 5.3.2. Isomorphic Graphs.

The two graphs in Figure 5.3.3 are isomorphic. The isomorphism is

\begin{align*} A \mapsto \amp I\\ B \mapsto \amp J\\ C \mapsto \amp L\\ D \mapsto \amp K\\ E \mapsto \amp M\\ F \mapsto \amp N\\ G \mapsto \amp P\\ H \mapsto \amp O \end{align*}

Drag the vertices of the graph on the left around until that graph looks like the graph on the right.

Figure 5.3.3. Two Isomorphic Graphs
Checkpoint 5.3.4.

Determine which graphs in Figure 5.2.43 and Figure 5.2.44 are isomorphic. State the isomorphism (i.e., explicitly give the function).