The minimal number of edges to add to make a graph Hamiltonian.
A graph is Hamiltonian if it contains a cycle as a subgraph, which contains all vertices.

The threshold graph corresponding to the composition.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.

The core of a graph.
The core of a graph $G$ is the smallest graph $C$ such that there is a homomorphism from $G$ to $C$ and a homomorphism from $C$ to $G$.
Note that the core of a graph is not necessarily connected, see [2].

The composition corresponding to the valley set of a standard tableau.
Let $T$ be a standard tableau of size $n$.
An entry $i$ of $T$ is a descent if $i+1$ is in a lower row (in English notation), otherwise $i$ is an ascent.
An entry $2 \leq i \leq n-1$ is a valley if $i-1$ is a descent and $i$ is an ascent.
This map returns the composition $c_1,\dots,c_k$ of $n$ such that $\{c_1, c_1+c_2,\dots, c_1+\dots+c_k\}$ is the valley set of $T$.