gives a canonical form of the graph g.
uses rules vw to specify the graph.
Details and Options
- 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.
- A Method option can be given. Possible Method settings include:
"Bliss" Bliss canonicalization "Nauty" Nauty canonicaliization
Examplesopen allclose all
CanonicalGraph works with undirected graphs:
Use rules to specify the graph:
CanonicalGraph works with large graphs:
Properties & Relations (3)
A graph and its canonical graph are isomorphic:
Isomorphic graphs have the same canonical graph:
Use FindGraphIsomorphism to find a canonical ordering of vertices of a graph:
Wolfram Research (2014), CanonicalGraph, Wolfram Language function, https://reference.wolfram.com/language/ref/CanonicalGraph.html (updated 2021).
Wolfram Language. 2014. "CanonicalGraph." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2021. https://reference.wolfram.com/language/ref/CanonicalGraph.html.
Wolfram Language. (2014). CanonicalGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/CanonicalGraph.html