CanonicalGraph

CanonicalGraph[g]
gives a canonical graph of the graph g.

CanonicalGraph[{vw,}]
uses rules to specify the graph g.

DetailsDetails

  • CanonicalGraph is also known as canonical graph labeling or canonical form of a graph.
  • CanonicalGraph is often used to compare and match a graph to a large collection of graphs.
  • CanonicalGraph[g] returns a graph with vertices , , that is isomorphic to g.
  • Isomorphic graphs have the same canonical graph.

ExamplesExamplesopen allclose all

Basic Examples  (1)Basic Examples  (1)

Find a canonical graph of the Pappus graph:

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

These two graphs are isomorphic:

In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
Out[4]=
Introduced in 2014
(10.0)
| Updated in 2015
(10.3)
Translate this page: