G = generateBipartiteGraphs n
G = generateBipartiteGraphs(n, m)
G = generateBipartiteGraphs(n, m, e)
G = generateBipartiteGraphs(n, m, le, ue)
G = generateBipartiteGraphs R
G = generateBipartiteGraphs(R, m)
G = generateBipartiteGraphs(R, m, e)
G = generateBipartiteGraphs(R, m, le, ue)
This method generates all bipartite graphs on $n$ vertices. The size of the bipartition is specified by giving the size of one class; the other class is determined automatically from the number of vertices.
If only one integer argument is given, then the method generates all bipartite graphs on that number of vertices with first class of sizes $0$ to $n$.
If a PolynomialRing $R$ is supplied instead, then the number of vertices is the number of generators. Moreover, the strings are automatically converted to graphs in $R$.
|
|
The number of vertices $n$ must be positive as nauty cannot handle graphs with zero vertices.
The object generateBipartiteGraphs is a method function with options.