graph isomorphism

What Is Isomorphism Explain With Two Examples? For example, both graphs are connected, have four vertices and three edges. … Two graphs G1 and G2 are isomorphic if there exists a match- ing between their vertices so that two vertices are connected by an edge in G1 if and only if corresponding vertices are connected