more info: Consider the following statement from "Pearls in Graph Theory" (Harstfield, Ringel):
"Two graphs $\text{G}_1, \text{G}_2$ with $p$ vertices are said to be $isomorphic$ if the vertices of $\text{G}_1$ and $\text{G}_2$ can be labeled with the numbers from 1 to $p$ such that whenever vertex $i$ is adjacent to vertex $j$ in $\text{G}_1$, then vertex $i$ is adjacent to vertex $j$ in $\text{G}_2$ and conversely.
Such a labeliing is the same as a one-to-one correspondence between $\text{V(G}_1)$ and $\text{V(G}_2)$ that preserves adjancency."