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.

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

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.

RankGraph[g, l] partitions the vertices into classes based on the shortest geodesic distance to a member of list l.

VertexCoverQ[g, c] yields True if the vertices in list c define a vertex cover of graph g.

WriteGraph[g, f] writes graph g to file f using an edge list representation.

SystemInformation gives detailed information about your Mathematica system. "Packages & Files" under the Kernel tab gives information about the packages currently loaded into ...