- Two graphs are isomorphic if there is a renaming of vertices that makes them equal.
- IsomorphicGraphQ[g1,g2,…] gives True if all the gi are isomorphic.
Basic Examples (1)
Test whether two graphs are isomorphic:
Find an isomorphism that maps g to h:
Renaming the vertices of graph g gets an equal graph as h:
Properties & Relations (10)
Introduced in 2010
Updated in 2012