CompleteKaryTree[n, k] returns a complete k-ary tree on n vertices.

ConstructTableau[p] performs the bumping algorithm repeatedly on each element of permutation p, resulting in a distinct Young tableau.

Contract[g, {x, y}] gives the graph resulting from contracting the pair of vertices {x, y} of graph g.

CostOfPath[g, p] sums up the weights of the edges in graph g defined by the path p.

CyclicGroup[n] returns the cyclic group of permutations on n symbols.

Degrees[g] returns the degrees of vertex 1, 2, 3, ... in that order.

DegreesOf2Neighborhood[g, v] returns the sorted list of degrees of vertices of graph g within a distance of 2 from v.

DeleteFromTableau[t, r] deletes the last element of row r from Young tableau t.

DeleteVertex[g, v] deletes a single vertex v from graph g. Here v is a vertex number.

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