- FindStat

Your data matches 114 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000097
(load all 13 compositions to match this statistic)

Mapping

St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => 1
([],2)
 => 1
([(0,1)],2)
 => 2
([],3)
 => 1
([(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,2)],3)
 => 3
([],4)
 => 1
([(2,3)],4)
 => 2
([(1,3),(2,3)],4)
 => 2
([(0,3),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => 2
([(1,2),(1,3),(2,3)],4)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
([],5)
 => 1
([(3,4)],5)
 => 2
([(2,4),(3,4)],5)
 => 2
([(1,4),(2,4),(3,4)],5)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => 2
([(1,4),(2,3)],5)
 => 2
([(1,4),(2,3),(3,4)],5)
 => 2
([(0,1),(2,4),(3,4)],5)
 => 2
([(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 3

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: St000093
(load all 7 compositions to match this statistic)

Mapping

Mp00111: Graphs —complement⟶ Graphs
St000093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => 1
([],2)
 => ([(0,1)],2)
 => 1
([(0,1)],2)
 => ([],2)
 => 2
([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1
([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2
([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(1,3),(2,3)],4)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([],4)
 => 4
([],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
([(3,4)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(1,4),(2,3)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(3,4)],5)
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,4),(3,4)],5)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(1,4),(2,3)],5)
 => 3

Description

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$ .

Matching statistic: St001316
(load all 4 compositions to match this statistic)

Mapping

Mp00154: Graphs —core⟶ Graphs
St001316: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => 1
([],2)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => 2
([],3)
 => ([],1)
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([],4)
 => ([],1)
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 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
([],5)
 => ([],1)
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,3)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(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,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,3),(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,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3

Description

The domatic number of a graph. This is the maximal size of a partition of the vertices into dominating sets.

Matching statistic: St001656
(load all 5 compositions to match this statistic)

Mapping

Mp00154: Graphs —core⟶ Graphs
St001656: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => 1
([],2)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => 2
([],3)
 => ([],1)
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([],4)
 => ([],1)
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 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
([],5)
 => ([],1)
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,3)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(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,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,3),(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,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3

Description

The monophonic position number of a graph. A subset

$M$ of the vertex set of a graph is a monophonic position set if no three vertices of

$M$ lie on a common induced path. The monophonic position number is the size of a largest monophonic position set.

Matching statistic: St000147
(load all 5 compositions to match this statistic)

Mapping

Mp00154: Graphs —core⟶ Graphs
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => [1]
 => 1
([],2)
 => ([],1)
 => [1]
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => [2]
 => 2
([],3)
 => ([],1)
 => [1]
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([],4)
 => ([],1)
 => [1]
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => [2]
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => [2]
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 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
([],5)
 => ([],1)
 => [1]
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(1,4),(2,3)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => [2]
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [2,2,2,2,2]
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(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]
 => 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]
 => 4
([(0,3),(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]
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => [3]
 => 3

Description

The largest part of an integer partition.

Matching statistic: St000273
(load all 2 compositions to match this statistic)

Mapping

Mp00154: Graphs —core⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => ([],1)
 => 1
([],2)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2
([],3)
 => ([],1)
 => ([],1)
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([],4)
 => ([],1)
 => ([],1)
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 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
([],5)
 => ([],1)
 => ([],1)
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(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)
 => 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)
 => 4
([(0,3),(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)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3

Description

The domination number of a graph. The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.

Matching statistic: St000381
(load all 8 compositions to match this statistic)

Mapping

Mp00111: Graphs —complement⟶ Graphs
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => [1] => 1
([],2)
 => ([(0,1)],2)
 => [1,1] => 1
([(0,1)],2)
 => ([],2)
 => [2] => 2
([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => [1,1,1] => 1
([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [2,1] => 2
([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => [2,1] => 2
([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => [3] => 3
([],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [1,1,1,1] => 1
([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => 2
([(1,3),(2,3)],4)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => 2
([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => [2,1,1] => 2
([(0,3),(1,2)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2] => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => [2,2] => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [3,1] => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => [3,1] => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => [2,2] => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => [3,1] => 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([],4)
 => [4] => 4
([],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [1,1,1,1,1] => 1
([(3,4)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(1,4),(2,3)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2,1] => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2] => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [2,2,1] => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => [3,2] => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(3,4)],5)
 => [3,2] => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => [3,2] => 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => [4,1] => 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => [4,1] => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(2,4),(3,4)],5)
 => [4,1] => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,4),(3,4)],5)
 => [3,2] => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(1,4),(2,3)],5)
 => [3,2] => 3

Description

The largest part of an integer composition.

Matching statistic: St000382
(load all 2 compositions to match this statistic)

Mapping

Mp00111: Graphs —complement⟶ Graphs
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => [1] => 1
([],2)
 => ([(0,1)],2)
 => [1,1] => 1
([(0,1)],2)
 => ([],2)
 => [2] => 2
([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => [1,1,1] => 1
([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [2,1] => 2
([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => [2,1] => 2
([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => [3] => 3
([],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [1,1,1,1] => 1
([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => 2
([(1,3),(2,3)],4)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => [2,1,1] => 2
([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => [2,1,1] => 2
([(0,3),(1,2)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2] => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => [2,2] => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [3,1] => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => [3,1] => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,3),(1,2)],4)
 => [2,2] => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => [3,1] => 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([],4)
 => [4] => 4
([],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [1,1,1,1,1] => 1
([(3,4)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,1,1,1] => 2
([(1,4),(2,3)],5)
 => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2,1] => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(2,3),(2,4),(3,4)],5)
 => [3,1,1] => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [2,2,1] => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2] => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => [3,2] => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [2,2,1] => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,3),(2,3),(2,4)],5)
 => [3,2] => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,3),(3,4)],5)
 => [3,2] => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,3),(3,4)],5)
 => [3,2] => 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,4),(1,4),(2,4),(3,4)],5)
 => [4,1] => 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,4),(2,4),(3,4)],5)
 => [4,1] => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(2,4),(3,4)],5)
 => [4,1] => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(2,4),(3,4)],5)
 => [3,2] => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(1,4),(2,3)],5)
 => [3,2] => 3

Description

The first part of an integer composition.

Matching statistic: St000482
(load all 2 compositions to match this statistic)

Mapping

Mp00154: Graphs —core⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000482: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => ([],1)
 => 1
([],2)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2
([],3)
 => ([],1)
 => ([],1)
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([],4)
 => ([],1)
 => ([],1)
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 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
([],5)
 => ([],1)
 => ([],1)
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(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)
 => 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)
 => 4
([(0,3),(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)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3

Description

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.

Matching statistic: St000544
(load all 2 compositions to match this statistic)

Mapping

Mp00154: Graphs —core⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000544: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([],1)
 => ([],1)
 => ([],1)
 => 1
([],2)
 => ([],1)
 => ([],1)
 => 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([],2)
 => 2
([],3)
 => ([],1)
 => ([],1)
 => 1
([(1,2)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([],4)
 => ([],1)
 => ([],1)
 => 1
([(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 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
([],5)
 => ([],1)
 => ([],1)
 => 1
([(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => ([],2)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(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)
 => 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)
 => 4
([(0,3),(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)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([],3)
 => 3

Description

The cop number of a graph. This is the minimal number of cops needed to catch the robber. The algorithm is from [2].

The following 104 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St000734The last entry in the first row of a standard tableau. St000778The metric dimension of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000917The open packing number of a graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001286The annihilation number of a graph. St001322The size of a minimal independent dominating set in a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001654The monophonic hull number of a graph. St001829The common independence number of a graph. St001949The rigidity index of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001655The general position number of a graph. St001814The number of partitions interlacing the given partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000010The length of the partition. St000148The number of odd parts of a partition. St000286The number of connected components of the complement of a graph. St000383The last part of an integer composition. St000548The number of different non-empty partial sums of an integer partition. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000808The number of up steps of the associated bargraph. St000876The number of factors in the Catalan decomposition of a binary word. St000918The 2-limited packing number of a graph. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001315The dissociation 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. St001340The cardinality of a minimal non-edge isolating set of a graph. St001372The length of a longest cyclic run of ones of a binary word. St001933The largest multiplicity of a part in an integer partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St001091The number of parts in an integer partition whose next smaller part has the same size. St001323The independence gap of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001674The number of vertices of the largest induced star graph in the graph. St001777The number of weak descents in an integer composition. St001330The hat guessing number of a graph. St000667The greatest common divisor of the parts of the partition. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000992The alternating sum of the parts of an integer partition. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001571The Cartan determinant of the integer partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000013The height of a Dyck path. St000160The multiplicity of the smallest part of a partition. St000439The position of the first down step of a Dyck path. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St000741The Colin de Verdière graph invariant. St000454The largest eigenvalue of a graph if it is integral. St000479The Ramsey number of a graph. St001645The pebbling number of a connected graph. St000288The number of ones in a binary word. St000477The weight of a partition according to Alladi. St000668The least common multiple of the parts of the partition. St000770The major index of an integer partition when read from bottom to top. St000993The multiplicity of the largest part of an integer partition. St001060The distinguishing index of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001812The biclique partition number of a graph. St001834The number of non-isomorphic minors of a graph. St000676The number of odd rises of a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000025The number of initial rises of a Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001809The index of the step at the first peak of maximal height in a Dyck path. St000024The number of double up and double down steps of a Dyck path. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St000444The length of the maximal rise 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. St001651The Frankl number of a lattice. St000733The row containing the largest entry of a standard tableau. St000157The number of descents of a standard tableau. St000443The number of long tunnels of a Dyck path. 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. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St001570The minimal number of edges to add to make a graph Hamiltonian. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000455The second largest eigenvalue of a graph if it is integral. 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. St001480The number of simple summands of the module J^2/J^3. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000738The first entry in the last row of a standard tableau. St000474Dyson's crank of a partition. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001621The number of atoms of a lattice. St001624The breadth of a lattice.