RemoveMultipleEdges[g] returns the graph obtained by deleting multiple edges from g.

RemoveSelfLoops[g] returns the graph obtained by deleting self-loops in g.

ResidualFlowGraph[g, flow] returns the directed residual flow graph for graph g with respect to flow.

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

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.

RGFs[n] lists all restricted growth functions on the first n natural numbers in lexicographic order.

RGFToSetPartition[rgf, set] converts the restricted growth function rgf into the corresponding set partition of set.

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

RootedEmbedding[g, v] constructs a rooted embedding of graph g with vertex v as the root. RootedEmbedding[g] constructs a rooted embedding with a center of g as the root.