FindGraphIsomorphism

finds an isomorphism that maps the graph

by renaming vertices.

FindGraphIsomorphism gives a list of replacement rules where are vertices in and are vertices in .

Two graphs are isomorphic if there is a renaming of vertices that make them equal.

Find an isomorphism that maps two graphs:

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: