graph-theory Definition Graph Isomorphism Two graphs G and H are called isomorphic if there exists a bijection f:V(G)→V(H) which contains the adjacency: ∀x,y∈V(G):xy∈E(G)⟺f(x)f(y)∈E(H)