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

Synopsis

• Usage:

  L' = relabelGraph(L, i, a)

  L' = relabelGraph(L, i)

  L' = relabelGraph L

  T = relabelGraph(S, i, a)

  T = relabelGraph(S, i)

  T = relabelGraph S

  H = relabelGraph(G, i, a)

  H = relabelGraph(G, i)

  H = relabelGraph G

• Inputs:
  • L, a list, a list of graphs in various formats
  • S, a string, a graph encoded in either Sparse6 or Graph6 format
  • G, an instance of the type Graph
  • i, an integer, a choice of invariant to order by ($0 \leq i \leq 15$, default is $0$)
  • a, an integer, a non-negative argument passed to nauty, (default is $3$)
• Outputs:
  • L', a list, a list of graphs isomorphic to $S$
  • T, a string, a graph isomorphic to $S$ encoded in either Sparse6 or Graph6 format
  • H, an instance of the type Graph, a graph isomorphic to $G$

Description

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

See also

• relabelBipartite -- relabels a bipartite graph so all vertices of a given class are contiguous