Macaulay2 » Documentation
Packages » NautyGraphs :: relabelGraph
next | previous | forward | backward | up | index | toc

relabelGraph -- applies a vertex invariant based refinement to a graph

Synopsis

Description

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.
i1 : G = graph {{0,1},{1,2},{2,3},{3,4},{0,4}}

o1 = Graph{0 => {1, 4}}
           1 => {0, 2}
           2 => {1, 3}
           3 => {2, 4}
           4 => {0, 3}

o1 : Graph
i2 : relabelGraph G

o2 = Graph{0 => {1, 2}}
           1 => {0, 3}
           2 => {0, 4}
           3 => {1, 4}
           4 => {2, 3}

o2 : Graph

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

See also

Ways to use relabelGraph :

For the programmer

The object relabelGraph is a method function.