The cardinality of a maximal independent set of vertices of a graph. An independent set of a graph is a set of pairwise non-adjacent vertices. A maximum independent set is an independent set of maximum cardinality. This statistic is also called the independence number or stability number $\alpha(G)$ of $G$.

The order of the largest clique of the graph. A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.

The chromatic number of a graph. The minimal number of colors needed to color the vertices of the graph such that no two vertices which share an edge have the same color.

The (zero)-forcing number of a graph. This is the minimal number of vertices initially coloured black, such that eventually all vertices of the graph are coloured black when using the following rule: when $u$ is a black vertex of $G$, and exactly one neighbour $v$ of $u$ is white, then colour $v$ black.

The maximal number of occurrences of a colour in a proper colouring of a graph. To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the largest part occurring in any of these partitions. For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$. Therefore, the statistic on this graph is $3$.

The size of the core of a graph. The core of the graph $G$ is the smallest graph $C$ such that there is a graph homomorphism from $G$ to $C$ and a graph homomorphism from $C$ to $G$.

The upper domination number of a graph. This is the maximum cardinality of a minimal dominating set of $G$. The smallest graph with different upper irredundance number and upper domination number has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [1].

The upper irredundance number of a graph. A set $S$ of vertices is irredundant, if there is no vertex in $S$, whose closed neighbourhood is contained in the union of the closed neighbourhoods of the other vertices of $S$. The upper irredundance number is the largest size of a maximal irredundant set. The smallest graph with different upper irredundance number and upper domination number [[St001337]] has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [2].

The Alon-Tarsi number of a graph. Let $G$ be a graph with vertices $\{1,\dots,n\}$ and edge set $E$. Let $P_G=\prod_{i < j, (i,j)\in E} x_i-x_j$ be its graph polynomial. Then the Alon-Tarsi number is the smallest number $k$ such that $P_G$ contains a monomial with exponents strictly less than $k$.

The number of independent sets of vertices of a graph. An independent set of vertices of a graph $G$ is a subset $U \subset V(G)$ such that no two vertices in $U$ are adjacent. This is also the number of vertex covers of $G$ as the map $U \mapsto V(G)\setminus U$ is a bijection between independent sets of vertices and vertex covers. The size of the largest independent set, also called independence number of $G$, is [[St000093]]