@hyper-neutrino. Ohh! I will give you a defintion then if you have time please:
The simple graphs $G_1 = (V_1, E_1)$ and $G_2 = (V_2, E_2)$ are isomorphic if there exists a oneto-one and onto function f from V1 to V2 with the property that a and b are adjacent in G1 if
and only if f (a) and f (b) are adjacent in G2, for all a and b in V1. Such a function f is called
an isomorphism.∗ Two simple graphs that are not isomorphic are called nonisomorphic.