3.Next

In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H
:such that any two vertices u and v of G are adjacent in G if and only if and are adjacent in H. This kind of bijection is commonly described as "edge-preserving bijection", in accordance with the general notion

3.Next