>
|
|
Find a canonical representation of a particular graph.
>
|
|
| (1) |
| (2) |
Display the computed canonical labeling for the specified graph.
>
|
|
| (3) |
Observe that by permuting the vertices of the original graph, it is possible to generate a version of the graph for which CanonicalGraph returns a labeling distinct from the previous one.
>
|
|
| (4) |
>
|
|
| (5) |
Both labelings are canonical, as evidenced by the fact that the adjacency matrices of the resulting graphs are identical.
>
|
|
Find a canonical representation of a particular graph.
>
|
|
| (7) |
| (8) |
Display the computed canonical labeling for the specified graph.
>
|
|
| (9) |
Observe that by permuting the vertices of the original graph, it is possible to generate a version of the graph for which CanonicalGraph returns a labeling distinct from the previous one.
>
|
|
| (10) |
>
|
|
| (11) |
Both labelings are canonical, as evidenced by the fact that the adjacency matrices of the resulting graphs are identical.
>
|
|