RankGraph[g, l] partitions the vertices into classes based on the shortest geodesic distance to a member of list l.

RotateVertices[v, \[Theta]] rotates each vertex position in list v by \[Theta] radians about the origin (0, 0). RotateVertices[g, \[Theta]] rotates the embedding of the graph ...

SamenessRelation[l] constructs a binary relation from a list l of permutations, which is an equivalence relation if l is a permutation group.

ToCycles[p] gives the cycle structure of permutation p as a list of cyclic permutations.

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.

UnrankKSubset[m, k, l] gives the m\[Null]^th k-subset of set l, listed in lexicographic order.

VertexCoverQ[g, c] yields True if the vertices in list c define a vertex cover of graph g.

WriteGraph[g, f] writes graph g to file f using an edge list representation.

The functionality of NumericalMath`ListIntegrate` is now accessible by using the built-in Mathematica kernel functions Integrate and Interpolation.