RandomVertices[g] assigns a random embedding to graph g.

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

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

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.

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

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

RGFQ[l] yields True if l is a restricted growth function. It yields False otherwise.

RobertsonGraph returns a 19-vertex graph that is the unique (4, 5)-cage graph.

SimpleQ[g] yields True if g is a simple graph, meaning it has no multiple edges and contains no self-loops.