next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
Nauty :: relabelGraph

relabelGraph -- applies a canonical labeling to a graph

Synopsis

Description

This method applies one of sixteen canonical labelings to a graph. See the nauty documentation for a more complete description of each and how the argument a is used.

The fifteen canonical labelins are: i = 0: none, i = 1: twopaths, i = 2: adjtriang(K), i = 3: triples, i = 4: quadruples, i = 5: celltrips, i = 6: cellquads, i = 7: cellquins, i = 8: distances(K), i = 9: indsets(K), i = 10: cliques(K), i = 11: cellcliq(K), i = 12: cellind(K), i = 13: adjacencies, i = 14: cellfano, and i = 15: cellfano2.
i1 : R = QQ[a..e];
i2 : G = cycle R;
i3 : H = graph {a*e, e*c, c*b, b*d, d*a};
i4 : relabelGraph G == relabelGraph H

o4 = true
Note that on most small graphs, all sixteen orderings produce the same result.

See also

Ways to use relabelGraph :