IsomorphicGraphQ

IsomorphicGraphQ[g1,g2]
yields True if the graphs and are isomorphic, and False otherwise.

DetailsDetails

  • Two graphs are isomorphic if there is a renaming of vertices that makes them equal.
  • IsomorphicGraphQ[g1,g2,] gives True if all the are isomorphic.

ExamplesExamplesopen allclose all

Basic Examples  (1)Basic Examples  (1)

Test whether two graphs are isomorphic:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=

Find an isomorphism that maps g to h:

In[3]:=
Click for copyable input
Out[3]=

Renaming the vertices of graph g gets an equal graph as h:

In[4]:=
Click for copyable input
Out[4]=
Introduced in 2010
(8.0)
| Updated in 2012
(9.0)
Translate this page: