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.

ShakeGraph[g, d] performs a random perturbation of the vertices of graph g, with each vertex moving, at most, a distance d from its original position.

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.