RankKSubset[s, l] gives the rank of k-subset s of set l in the lexicographic ordering of the k-subsets of l.

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

RankRGF[f] returns the rank of a restricted growth function (RGF) f in the lexicographic order of all RGFs.

RankSetPartition[sp, s] ranks sp in the list of all set partitions of set s. RankSetPartition[sp] ranks sp in the list of all set partitions of the set of elements that ...

RankSubset[l, s] gives the rank, in canonical order, of subset s of set l.

ReadGraph[f] reads a graph represented as edge lists from file f and returns a graph object.

RealizeDegreeSequence[s] constructs a semirandom graph with degree sequence s.

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

RegularGraph[k, n] constructs a semirandom k-regular graph on n vertices, if such a graph exists.

RegularQ[g] yields True if g is a regular graph.