Wolfram Language & System 11.0 (2016)|Legacy Documentation
This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)
finds an isomorphism that maps the graph g1 to g2 by renaming vertices.
finds at most n isomorphisms.
uses rules vw to specify the graph g.
- FindGraphIsomorphism gives a list of associations Association[v1->w1,v2->w2,…] where vi are vertices in g1 and wi are vertices in g2.
- FindGraphIsomorphism gives an empty list if no isomorphism can be found.
- FindGraphIsomorphism[g1,g2,All] gives all the isomorphisms.
- Two graphs are isomorphic if there is a renaming of vertices that makes them equal.
Introduced in 2010
(8.0)| Updated in 2015