RandomTableau[p] constructs a random Young tableau of shape p.

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

RankPermutation[p] gives the rank of permutation p in lexicographic order.

ReflexiveQ[g] yields True if the adjacency matrix of g represents a reflexive binary relation.

RevealCycles[p] unveils the canonical hidden cycle structure of permutation p.

ReverseEdges[g] flips the directions of all edges in a directed graph.

SignaturePermutation[p] gives the signature of permutation p.

Spectrum[g] gives the eigenvalues of graph g.

TravelingSalesmanBounds[g] gives upper and lower bounds on a minimum-cost traveling salesman tour of graph g.

TriangleInequalityQ[g] yields True if the weights assigned to the edges of graph g satisfy the triangle inequality.