newEdges -- replaces disjoint pairs of edges by disjoint pairs of two-chains

Synopsis

• Usage:

  N' = newEdges L

  N = newEdges S

  N = newEdges(G, R)

• Inputs:
  • L, a list, containing graphs in various formats
  • S, a string, a graph encoded in either Sparse6 or Graph6 format
  • G, a graph
  • R, a polynomial ring, a ring with exactly two more variables than the ring of G
• Outputs:
  • N', a list, containing graphs in either Graph6 or Sparse6 format, modified as described below
  • N, a list, a list of graphs, in the same format as the input, modified as described below

Description

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

i2 : G = graph {a*b, c*d};

i3 : S = QQ[a..f];

i4 : newEdges(G, S)

o4 = {Graph{edges => {{a, e}, {b, e}, {c, f}, {d, f}, {e, f}}}}
            ring => S
            vertices => {a, b, c, d, e, f}

o4 : List