PlanarQ[g] yields True if graph g is planar, meaning it can be drawn in the plane so no two edges cross.

PseudographQ[g] yields True if graph g is a pseudograph, meaning it contains self-loops.

Radius[g] gives the radius of graph g, the minimum eccentricity of any vertex of g.

RandomHeap[n] constructs a random heap on n elements.

RandomKSubset[l, k] gives a random subset of set l with exactly k elements.

RandomPartition[n] constructs a random partition of integer n.

RandomPermutation[n] generates a random permutation of the first n natural numbers.

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

RandomTree[n] constructs a random labeled tree on n vertices.

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