Your data matches 398 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000097
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000097: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
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.
Matching statistic: St000098
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000098: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
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.
Matching statistic: St000172
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000172: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
The Grundy number of a graph. The Grundy number $\Gamma(G)$ is defined to be the largest $k$ such that $G$ admits a greedy $k$-coloring. Any order of the vertices of $G$ induces a greedy coloring by assigning to the $i$-th vertex in this order the smallest positive integer such that the partial coloring remains a proper coloring. In particular, we have that $\chi(G) \leq \Gamma(G) \leq \Delta(G) + 1$, where $\chi(G)$ is the chromatic number of $G$ ([[St000098]]), and where $\Delta(G)$ is the maximal degree of a vertex of $G$ ([[St000171]]).
Matching statistic: St000363
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000363: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
The number of minimal vertex covers of a graph. A '''vertex cover''' of a graph $G$ is a subset $S$ of the vertices of $G$ such that each edge of $G$ contains at least one vertex of $S$. A vertex cover is minimal if it contains the least possible number of vertices. This is also the leading coefficient of the clique polynomial of the complement of $G$. This is also the number of independent sets of maximal cardinality of $G$.
Matching statistic: St000469
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000469: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
The distinguishing number of a graph. This is the minimal number of colours needed to colour the vertices of a graph, such that only the trivial automorphism of the graph preserves the colouring. For connected graphs, this statistic is at most one plus the maximal degree of the graph, with equality attained for complete graphs, complete bipartite graphs and the cycle with five vertices, see Theorem 4.2 of [2].
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000636: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
The hull number of a graph. The convex hull of a set of vertices $S$ of a graph is the smallest set $h(S)$ such that for any pair $u,v\in h(S)$ all vertices on a shortest path from $u$ to $v$ are also in $h(S)$. The hull number is the size of the smallest set $S$ such that $h(S)$ is the set of all vertices.
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000722: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
The number of different neighbourhoods in a graph.
Matching statistic: St000926
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St000926: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
The clique-coclique number of a graph. This is the product of the size of a maximal clique [[St000097]] and the size of a maximal independent set [[St000093]].
Matching statistic: St001029
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St001029: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
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$.
Matching statistic: St001108
Mp00203: Graphs coneGraphs
Mp00264: Graphs delete endpointsGraphs
St001108: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> ([],1)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> ([],1)
=> 1
([(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 7
([],0)
=> ([],1)
=> ([],1)
=> 1
Description
The 2-dynamic chromatic number of a graph. A $k$-dynamic coloring of a graph $G$ is a proper coloring of $G$ in such a way that each vertex $v$ sees at least $\min\{d(v), k\}$ colors in its neighborhood. The $k$-dynamic chromatic number of a graph is the smallest number of colors needed to find an $k$-dynamic coloring. This statistic records the $2$-dynamic chromatic number of a graph.
The following 388 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001330The hat guessing number of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001670The connected partition number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001746The coalition number of a graph. St001883The mutual visibility number of a graph. St000171The degree of the graph. St000272The treewidth of a graph. St000300The number of independent sets of vertices of a graph. St000362The size of a minimal vertex cover of a graph. St000454The largest eigenvalue of a graph if it is integral. St000536The pathwidth of a graph. St000778The metric dimension of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001644The dimension of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001949The rigidity index of a graph. St000349The number of different adjacency matrices of a graph. St001463The number of distinct columns in the nullspace of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000979Half of MacMahon's equal index of a Dyck path. St001708The number of pairs of vertices of different degree in a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001279The sum of the parts of an integer partition that are at least two. St001692The number of vertices with higher degree than the average degree in a graph. St000087The number of induced subgraphs. St000286The number of connected components of the complement of a graph. St000391The sum of the positions of the ones in a binary word. St000822The Hadwiger number of the graph. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001342The number of vertices in the center of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001725The harmonious chromatic number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001963The tree-depth of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000301The number of facets of the stable set polytope of a graph. St000310The minimal degree of a vertex of a graph. St000741The Colin de Verdière graph invariant. St000915The Ore degree of a graph. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001391The disjunction number of a graph. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001706The number of closed sets in a graph. St001962The proper pathwidth of a graph. St000008The major index of the composition. St000176The total number of tiles in the Gelfand-Tsetlin pattern. St000230Sum of the minimal elements of the blocks of a set partition. St000756The sum of the positions of the left to right maxima of a permutation. St000867The sum of the hook lengths in the first row of an integer partition. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000235The number of indices that are not cyclical small weak excedances. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000616The inversion index of a permutation. St001161The major index north count of a Dyck path. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001379The number of inversions plus the major index of a permutation. St001812The biclique partition number of a graph. St000240The number of indices that are not small excedances. St000676The number of odd rises of a Dyck path. St001570The minimal number of edges to add to make a graph Hamiltonian. St000656The number of cuts of a poset. St000910The number of maximal chains of minimal length in a poset. St001626The number of maximal proper sublattices of a lattice. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000806The semiperimeter of the associated bargraph. St000477The weight of a partition according to Alladi. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000914The sum of the values of the Möbius function of a poset. St000681The Grundy value of Chomp on Ferrers diagrams. St001118The acyclic chromatic index of a graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000420The number of Dyck paths that are weakly above a Dyck path. St000674The number of hills of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000993The multiplicity of the largest part of an integer partition. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001808The box weight or horizontal decoration of a Dyck path. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000444The length of the maximal rise of a Dyck path. St000460The hook length of the last cell along the main diagonal of an integer partition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000567The sum of the products of all pairs of parts. St000667The greatest common divisor of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000744The length of the path to the largest entry in a standard Young tableau. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000932The number of occurrences of the pattern UDU in a Dyck path. St000947The major index east count of a Dyck path. St001128The exponens consonantiae of a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001360The number of covering relations in Young's lattice below a partition. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001571The Cartan determinant of the integer partition. St001933The largest multiplicity of a part in an integer partition. St001959The product of the heights of the peaks of a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000874The position of the last double rise in a Dyck path. St001176The size of a partition minus its first part. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001480The number of simple summands of the module J^2/J^3. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St001931The weak major index of an integer composition regarded as a word. St001060The distinguishing index of a graph. St000769The major index of a composition regarded as a word. St000299The number of nonisomorphic vertex-induced subtrees. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001093The detour number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001716The 1-improper chromatic number of a graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St001271The competition number of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001512The minimum rank of a graph. St001638The book thickness of a graph. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000381The largest part of an integer composition. St000767The number of runs in an integer composition. St000808The number of up steps of the associated bargraph. St000820The number of compositions obtained by rotating the composition. St000903The number of different parts of an integer composition. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001642The Prague dimension of a graph. St000766The number of inversions of an integer composition. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001423The number of distinct cubes in a binary word. St001524The degree of symmetry of a binary word. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St000288The number of ones in a binary word. St000675The number of centered multitunnels of a Dyck path. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000390The number of runs of ones in a binary word. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001235The global dimension of the corresponding Comp-Nakayama algebra. St001471The magnitude of a Dyck path. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St000091The descent variation of a composition. St000120The number of left tunnels of a Dyck path. St000292The number of ascents of a binary word. St000389The number of runs of ones of odd length in a binary word. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000761The number of ascents in an integer composition. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001413Half the length of the longest even length palindromic prefix of a binary word. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001424The number of distinct squares in a binary word. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001584The area statistic between a Dyck path and its bounce path. St001623The number of doubly irreducible elements of a lattice. St000467The hyper-Wiener index of a connected graph. St000937The number of positive values of the symmetric group character corresponding to the partition. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St000145The Dyson rank of a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001651The Frankl number of a lattice. St000643The size of the largest orbit of antichains under Panyushev complementation. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000006The dinv of a Dyck path. St000079The number of alternating sign matrices for a given Dyck path. St000258The burning number of a graph. St000268The number of strongly connected orientations of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000482The (zero)-forcing number of a graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000918The 2-limited packing number of a graph. St000948The chromatic discriminant of a graph. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001073The number of nowhere zero 3-flows of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001315The dissociation number of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001488The number of corners of a skew partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001668The number of points of the poset minus the width of the poset. St001890The maximum magnitude of the Möbius function of a poset. St000095The number of triangles of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000387The matching number of a graph. St000535The rank-width of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001071The beta invariant of the graph. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001333The cardinality of a minimal edge-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001393The induced matching number of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001736The total number of cycles in a graph. St001797The number of overfull subgraphs of a graph. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001404The number of distinct entries in a Gelfand Tsetlin pattern. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St000144The pyramid weight of the Dyck path. St000443The number of long tunnels of a Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St000005The bounce statistic of a Dyck path. St000015The number of peaks of a Dyck path. St000335The difference of lower and upper interactions. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001481The minimal height of a peak of a Dyck path. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001530The depth of a Dyck path. St000117The number of centered tunnels of a Dyck path. St000331The number of upper interactions of a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000455The second largest eigenvalue of a graph if it is integral. St001592The maximal number of simple paths between any two different vertices of a graph. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001877Number of indecomposable injective modules with projective dimension 2. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001713The difference of the first and last value in the first row of the Gelfand-Tsetlin pattern. St000456The monochromatic index of a connected graph. St001875The number of simple modules with projective dimension at most 1. St001545The second Elser number of a connected graph. St000264The girth of a graph, which is not a tree. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001281The normalized isoperimetric number of a graph. St000379The number of Hamiltonian cycles in a graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000464The Schultz index of a connected graph. St000699The toughness times the least common multiple of 1,.