gives a canonical form of the graph g.
uses rules vw to specify the graph.
- 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 1, 2, … that is isomorphic to g.
- Isomorphic graphs have the same canonical graph.
Examplesopen allclose all
Properties & Relations (3)
Use FindGraphIsomorphism to find a canonical ordering of vertices of a graph:
Introduced in 2014
|Updated in 2015