i am not sure about the rigourous definition of isomorphism between graphs but I think it prolly might be smth like two graphs are isomorphic if there is a bijection such that x and y are connected with an edge iff f(x) and f(y) are connected with an edge..
the bijection here just are moving around and labeling vertices and edges.