next | previous | forward | backward | up | top | index | toc | Macaulay2 web site

EdgeIdeals :: randomGraph

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

This function allows one to create a graph on an underlying vertex set with a given number of randomly chosen edges.

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

i2 : randomGraph(R,4)

o2 = Graph{edges => {{x , x }, {x , x }, {x , x }, {x , x }}}
                       4   8     1   3     6   7     3   8
           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 }}}
                       1   8     7   9     3   4     5   6
           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

Ways to use `randomGraph` :

randomGraph(PolynomialRing,ZZ)