This method applies one of sixteen vertex invariant based refinements to a graph. See the nauty documentation for a more complete description of each and how the argument a is used.
The sixteen vertex invariants 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.
G = graph {{0,1},{1,2},{2,3},{3,4},{0,4}} |
relabelGraph G |
Note that on most small graphs, all sixteen orderings produce the same result.