PermuteSubgraph[g, p] permutes the vertices of a subgraph of g induced by p according to p.

RandomRGF[n] returns a random restricted growth function (RGF) defined on the first n natural numbers. RandomRGF[n, k] returns a random RGF defined on the first n natural ...

SetEdgeLabels[g, l] assigns the labels in l to edges of g.

SetVertexLabels[g, l] assigns the labels in l to vertices of g.

ShowLabeledGraph[g] displays graph g according to its embedding, with each vertex labeled with its vertex number.ShowLabeledGraph[g, l] uses the i\[Null]^th element of list l ...

TableauClasses[p] partitions the elements of permutation p into classes according to their initial columns during Young tableaux construction.

TransitiveClosure[g] finds the transitive closure of graph g, the supergraph of g that contains edge {x, y} if and only if there is a path from x to y.

TranslateVertices[v, {x, y}] adds the vector {x, y} to the vertex embedding location of each vertex in list v. TranslateVertices[g, {x, y}] translates the embedding of the ...

TwoColoring[g] finds a two-coloring of graph g if g is bipartite. It returns a list of the labels 1 and 2 corresponding to the vertices.

UnrankBinarySubset[n, l] gives the n\[Null]^th subset of list l, listed in increasing order of integers corresponding to the binary representations of the subsets.