LexicographicPermutations[l] constructs all permutations of list l in lexicographic order.

MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.

MinimumChangePermutations[l] constructs all permutations of list l such that adjacent permutations differ by only one transposition.

MultiplicationTable[l, f] constructs the complete transition table defined by the binary relation function f on the elements of list l.

Neighborhood[g, v, k] returns the subset of vertices in g that are at a distance of k or less from vertex v. Neighborhood[al, v, k] behaves identically, except that it takes ...

NextKSubset[l, s] gives the k-subset of list l, following the k-subset s in lexicographic order.

NormalizeVertices[v] gives a list of vertices with a similar embedding as v but with the coordinates of all points scaled to be between 0 and 1.

NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.

NumberOf2Paths[g, v] returns a sorted list that contains the number of paths of length 2 to different vertices of g from v.

PermutationGroupQ[l] yields True if the list of permutations l forms a permutation group.