The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. A graph is a split graph if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,b)$ is an edge and $(b,c)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.

The area statistic between a Dyck path and its bounce path. The bounce path [[Mp00099]] is weakly below a given Dyck path and this statistic records the number of boxes between the two paths.

The number of strictly unfriendly partitions of a graph. A strictly unfriendly partitions of a graph is a two-colouring of its vertices such that every vertex has more neighbours of the other colour than of the same colour. This statistic returns the number of strictly unfriendly partitions, up to switching the colours. For example, the complete graph on four vertices has three strictly unfriendly partitions: the three set partitions of the vertices into two blocks of size two.

The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $2$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore statistic $1$.

Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path.