DeleteVertices[g, vList] deletes vertices in vList from graph g. vList has the form {i, j, ...}, where i, j, ... are vertex numbers.

Distribution[l, set] lists the frequency of each element of set in list l.

ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.

GraphIntersection[g_1, g_2, ...] constructs the graph defined by the edges that are in all the graphs g_1, g_2, ....

GrayCodeKSubsets[l, k] generates k-subsets of l in Gray code order.

Greedy is a value that the option Algorithm can take in calls to functions such as VertexCover, telling the function to use a greedy algorithm.

Invariants is an option to the functions Isomorphism and IsomorphicQ that informs these functions about which vertex invariants to use in computing equivalences between ...

Inversions[p] counts the number of inversions in permutation p.

Josephus[n, m] generates the inverse of the permutation defined by executing every m\[Null]^th member in a circle of n members.

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