Definition Graph Isomorphism Two graphs and are called isomorphic, denoted , if there exists a bijection such that any two vertices are adjacent in if and only if are adjacent in . Formally, preserves the adjacency relation: