This method generates a specified number of random graphs on a given number of vertices with a given regularity. Note that some graphs may be isomorphic.
If a PolynomialRing $R$ is supplied instead, then the number of vertices is the number of generators. Moreover, the nauty-based strings are automatically converted to instances of the class Graph in $R$.
i1 : R = QQ[a..e]; |
i2 : generateRandomRegularGraphs(R, 3, 2) o2 = {Graph{edges => {{a, b}, {a, d}, {c, d}, {b, e}, {c, e}}}, Graph{edges => {{a, b}, {a, c}, {c, d}, {b, e}, {d, e}}}, ring => R ring => R vertices => {a, b, c, d, e} vertices => {a, b, c, d, e} ---------------------------------------------------------------------------------------------------------------------------- Graph{edges => {{a, c}, {b, c}, {a, d}, {b, e}, {d, e}}}} ring => R vertices => {a, b, c, d, e} o2 : List |
The number of vertices $n$ must be positive as nauty cannot handle graphs with zero vertices.
The object generateRandomRegularGraphs is a method function with options.