This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)

FindGraphIsomorphism

FindGraphIsomorphism
finds an isomorphism that maps the graph to by renaming vertices.
  • Two graphs are isomorphic if there is a renaming of vertices that make them equal.
Find an isomorphism that maps two graphs:
Find an isomorphism that maps two graphs:
In[1]:=
Click for copyable input
Out[1]=
FindGraphIsomorphism works with undirected graphs:
Directed graphs:
Graphs with self-loops:
It returns an empty list if no isomorphism can be found:
Works with large graphs:
Find an isomorphism that maps two graphs:
Highlight and label two graphs according to the mapping:
Isomorphic graphs have the same number of vertices and edges:
Test whether two graphs are isomorphic using IsomorphicGraphQ:
New in 8