 |
BUILT-IN MATHEMATICA SYMBOL
FindGraphIsomorphism
FindGraphIsomorphism[g1, g2]
finds an isomorphism that maps the graph 
to 
by renaming vertices.
Details and Options
- FindGraphIsomorphism gives a list of replacement rules
where 
are vertices in 
and 
are vertices in 
. - FindGraphIsomorphism gives an empty list if no isomorphism can be found.
- Two graphs are isomorphic if there is a renaming of vertices that make them equal.
Examplesopen all
Basic Examples (1)
Find an isomorphism that maps two graphs:
| In[1]:= |
| Out[1]= |  |
New in 8
