The dimension of the representation $V(\Lambda_1)$. The sizes of $E_6$ and $E_7$ can be seen in [1].

The number of pairs of vertices of a graph with distance 2. This is the coefficient of the quadratic term of the Wiener polynomial.

The number of induced paths on three vertices in a graph.

The game chromatic index of a graph. Two players, Alice and Bob, take turns colouring properly any uncolored edge of the graph. Alice begins. If it is not possible for either player to colour a edge, then Bob wins. If the graph is completely colored, Alice wins. The game chromatic index is the smallest number of colours such that Alice has a winning strategy.

The number of induced diamond graphs in a graph. A diamond graph is a cycle on four vertices, with an additional edge connecting two of the non-adjacent vertices.

The dinv defect of an integer partition. This is the number of cells $c$ in the diagram of an integer partition $\lambda$ for which $\operatorname{arm}(c)-\operatorname{leg}(c) \not\in \{0,1\}$.

The sum of the semi-lengths of tunnels before a valley of a Dyck path. For each valley $v$ in a Dyck path $D$ there is a corresponding tunnel, which is the factor $T_v = s_i\dots s_j$ of $D$ where $s_i$ is the step after the first intersection of $D$ with the line $y = ht(v)$ to the left of $s_j$. This statistic is $$\sum_v (j_v-i_v)/2.$$

The size of the orbit of an integer partition in Bulgarian solitaire. Bulgarian solitaire is the dynamical system where a move consists of removing the first column of the Ferrers diagram and inserting it as a row. This statistic returns the number of partitions that can be obtained from the given partition.

The least common multiple of the parts of the partition.

The number of semistandard tableaux on a given integer partition with minimal maximal entry. This is, for an integer partition $\lambda = (\lambda_1 > \cdots > \lambda_k > 0)$, the number of [[SemistandardTableaux|semistandard tableaux]] of shape $\lambda$ with maximal entry $k$. Equivalently, this is the evaluation $s_\lambda(1,\ldots,1)$ of the Schur function $s_\lambda$ in $k$ variables, or, explicitly, $$\prod_{(i,j) \in L} \frac{k + j - i}{ \operatorname{hook}(i,j) }$$ where the product is over all cells $(i,j) \in L$ and $\operatorname{hook}(i,j)$ is the hook length of a cell. See [Theorem 6.3, 1] for details.