# Isomorphism Of Graphs

Let G(V, E) and G*(V*, E*) are graphs and f : V  V* is a one-to-one correspondence beta sets of vertices such that [u, v] is an edge of G if and only if {f (u), f(v)} is an edge of G*. Then f is isomorphism between G and G*, and G and G* are called isomorphic graphs. Normally, we do not distinguish between isomorphic graphs (even though their diagrams may “look different”).