randomGraph -- returns a random graph

Synopsis

• Usage:

  G = randomGraph(R,d)

• Inputs:
  • R, a polynomial ring, which gives the vertex set of G
  • d, an integer, the number of edges in G
• Outputs:
  • G, a graph, a graph with d edges on vertex set determined by R

Description

i1 : R = QQ[x_1..x_9];

i2 : randomGraph(R,4)

o2 = Graph{edges => {{x , x }, {x , x }, {x , x }, {x , x }}}
                       3   4     1   4     6   7     1   9
           ring => R
           vertices => {x , x , x , x , x , x , x , x , x }
                         1   2   3   4   5   6   7   8   9

o2 : Graph

i3 : randomGraph(R,4)

o3 = Graph{edges => {{x , x }, {x , x }, {x , x }, {x , x }}}
                       4   9     5   6     5   7     4   5
           ring => R
           vertices => {x , x , x , x , x , x , x , x , x }
                         1   2   3   4   5   6   7   8   9

o3 : Graph

See also

• randomUniformHyperGraph -- returns a random uniform hypergraph
• randomHyperGraph -- returns a random hypergraph
• Constructor Overview -- a summary of the many ways of making graphs and hypergraphs