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.
References in periodicals archive ?
Among their topics are the isomorphism problem for Coxeter groups, hyperbolic Coxeter groups and space forms, equivelar polyhedra, configurations of points and lines, and the reciprocal inspiration of Coxeter and artists.
Examples include simultaneous surface resolution in quadratic and biquadratic Galois extensions, asymptotic behavior of cohomology, conic divisor classes over a normal monoid algebra, Rees algebras of the second syzygy module of the residue field of a regular local ring, a local global principle for the elementary unimodular vector group, picture invariants and the isomorphism problem for complex semisimple Lie algebras, arithmetic rank of certain Segre products, and strong semistability and Hilbert-Kunz multiplicity for singular plane curves.
In many cases the object recognition is treated as a tree isomorphism problem [13], [14].
9 DNA COMPUTING FOR SUBGRAPH ISOMORPHISM PROBLEM AND RELATED PROBLEMS (Sun-Yuan Hsieh, Chao-Wen Huang, and Hsin-Hung Chou).