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.

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

SelfComplementaryQ[g] yields True if graph g is self-complementary, meaning it is isomorphic to its complement.

SelfLoopsQ[g] yields True if graph g has self-loops.

SignaturePermutation[p] gives the signature of permutation p.

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

SmallestCyclicGroupGraph returns a smallest nontrivial graph whose automorphism group is cyclic.