Definition: Two graphs are isomorphic if there is a one-to-one correspondence between their vertices and there is an edge between two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph.
See also homeomorphic.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.
Cite this as:
Sandeep Kumar Shukla, "isomorphic", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/isomorphic.html