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

Synopsis

• Usage:

  L' = relabelBipartite L

  T = relabelBipartite S

  H = relabelBipartite G

• Inputs:
  • L, a list, a list of bipartite graphs in various formats
  • S, a string, a bipartite graph encoded in either Sparse6 or Graph6 format
  • G, a graph, a bipartite graph
• 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, a graph, a graph isomorphic to $G$

Description

i1 : R = QQ[a..f];

i2 : G = graph flatten apply({a,c,e}, v->v*{b,d,f})

o2 = Graph{"edges" => {{a, b}, {b, c}, {a, d}, {c, d}, {b, e}, {d, e}, {a, f}, {c, f}, {e, f}}}
           "ring" => R
           "vertices" => {a, b, c, d, e, f}

o2 : Graph

i3 : relabelBipartite G

o3 = Graph{"edges" => {{a, d}, {b, d}, {c, d}, {a, e}, {b, e}, {c, e}, {a, f}, {b, f}, {c, f}}}
           "ring" => R
           "vertices" => {a, b, c, d, e, f}

o3 : Graph

See also

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