The multiplicity of the standard representation in the Kronecker square corresponding to a partition. The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$: $$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$ This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{(n-1)1}$, for $\lambda\vdash n > 1$. For $n\leq1$ the statistic is undefined. It follows from [3, Prop.4.1] (or, slightly easier from [3, Thm.4.2]) that this is one less than [[St000159]], the number of distinct parts of the partition.

The number of distinct parts of the integer partition. This statistic is also the number of removeable cells of the partition, and the number of valleys of the Dyck path tracing the shape of the partition.

The number of addable cells of the Ferrers diagram of an integer partition.

The number of different multiplicities of parts of an integer partition.

The independence gap of a graph. This is the difference between the independence number [[St000093]] and the minimal size of a maximally independent set of a graph. In particular, this statistic is $0$ for well covered graphs

The minimal order of a graph which is not an induced subgraph of the given graph. For example, the graph with two isolated vertices is not an induced subgraph of the complete graph on three vertices. By contrast, the minimal number of vertices of a graph which is not a subgraph of a graph is one plus the clique number [[St000097]].

The diameter of a connected graph. This is the greatest distance between any pair of vertices.