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.

RotateVertices[v, \[Theta]] rotates each vertex position in list v by \[Theta] radians about the origin (0, 0). RotateVertices[g, \[Theta]] rotates the embedding of the graph ...

SamenessRelation[l] constructs a binary relation from a list l of permutations, which is an equivalence relation if l is a permutation group.

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.

SetPartitionQ[sp, s] determines if sp is a set partition of set s. SetPartitionQ[sp] tests if sp is a set of disjoint sets.

SetPartitions[set] returns the list of set partitions of set. SetPartitions[n] returns the list of set partitions of {1, 2, ..., n}.

SetPartitionToRGF[sp, set] converts the set partition sp of set into the corresponding restricted growth function.