completeGraph -- returns a complete graph

Synopsis

• Usage:

  K = completeGraph R

  K = completeGraph(R,n)

  K = completeGraph L

• Inputs:
  • R, a ring,
  • n, an integer, number of variables to use
  • L, a list, of vertices to make into a complete graph
• Outputs:
  • K, a graph, a complete graph on the vertices in L or on the variables of R

Description

i1 : R = QQ[a,b,c,d,e];

i2 : completeGraph R

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

o2 : Graph

i3 : completeGraph(R,3)

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

o3 : Graph

i4 : completeGraph {a,c,e}

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

o4 : Graph

See also

• completeMultiPartite -- returns a complete multipartite graph
• Constructor Overview -- a summary of the many ways of making graphs and hypergraphs