RandomRegularGraph(n,d) creates a d-regular undirected unweighted graph on n vertices. n and d cannot both be odd and d must satisfy d < n.

If the option connected is specified, the graph created will be connected. n and d must then satisfy n = 1 and d = 0, or n = 2 and d = 1, or n > 2 and d > 1 as well as the above.

For RandomRegularGraph(n,d,connected), a random tree with maximum degree <= d is first created.

For generating weighted graphs use weights = f and see AssignEdgeWeights for details about f.

The random number generator used can be seeded using the randomize function.

f := proc() local x; x := U(); if x=1 then 1 else 2 fi end: