For two graphs, $\mathcal G$ and $\mathcal H$, the two graphs are isomorphism on the following condition

$$u, v \text{ adjacent in } G \iff u, v \text{ adjacent in } H.$$

An algorithm to find approximate isomorphism is the .

Published: by ;

L Ma (2021). 'Graph Isomorphism', Datumorphism, 09 April. Available at: https://datumorphism.leima.is/cards/graph/graph-isomorphism/.

Current Ref:

• cards/graph/graph-isomorphism.md