isomorphism problem

isomorphism problem

[‚ī·sə′mȯr‚fiz·əm ‚präb·ləm] (mathematics) For two simple graphs with the same numbers of vertices and edges, the problem of determining whether there exist correspondences between these vertices and edges such that there is an edge between two vertices in one graph if and only if there is an edge between the corresponding vertices in the other.