- FindStat

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

Matching statistic: St001331
(load all 20 compositions to match this statistic)

Mapping

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

Values

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

Description

The size of the minimal feedback vertex set. A feedback vertex set is a set of vertices whose removal results in an acyclic graph.

Matching statistic: St001336
(load all 22 compositions to match this statistic)

Mapping

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

Values

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

Description

The minimal number of vertices in a graph whose complement is triangle-free.

Matching statistic: St001638
(load all 21 compositions to match this statistic)

Mapping

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

Values

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

Description

The book thickness of a graph. The book thickness (or pagenumber, or stacknumber) of a graph is the minimal number of pages required for a book embedding of a graph.

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

Mapping

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

Values

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

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

Mapping

Mp00259: Graphs —vertex addition⟶ Graphs
St000741: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

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

Description

The Colin de Verdière graph invariant.

Matching statistic: St000771
(load all 16 compositions to match this statistic)

Mapping

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

Values

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

Description

The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums

$0$ , which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian

$\left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right).$ Its eigenvalues are

$0,4,4,6$ , so the statistic is

$2$ . The path on four vertices has eigenvalues

$0, 4.7\dots, 6, 9.2\dots$ and therefore statistic

$1$ .

Matching statistic: St000772
(load all 16 compositions to match this statistic)

Mapping

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

Values

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

Description

The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums

$\left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right).$ Its eigenvalues are

$0,4,4,6$ , so the statistic is

$1$ . The path on four vertices has eigenvalues

$0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic

$1$ . The graphs with statistic

$n-1$ ,

$n-2$ and

$n-3$ have been characterised, see [1].

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

Mapping

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

Values

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

Description

The multiplicity of the largest Laplacian eigenvalue in a graph.

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

Mapping

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

Values

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

Description

The maximal multiplicity of a Laplacian eigenvalue in a graph.

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

Mapping

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

Values

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

Description

The maximal multiplicity of an eigenvalue in a graph.

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

St001723The differential of a graph. St001724The 2-packing differential of a graph. St000047The number of standard immaculate tableaux of a given shape. St000277The number of ribbon shaped standard tableaux. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000778The metric dimension of a graph. St000808The number of up steps of the associated bargraph. St001917The order of toric promotion on the set of labellings of a graph. St001949The rigidity index of a graph. St000089The absolute variation of a composition. St000377The dinv defect of an integer partition. St000469The distinguishing number of a graph. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001391The disjunction number of a graph. St001642The Prague dimension of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St000003The number of standard Young tableaux of the partition. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000093The cardinality of a maximal independent set of vertices of a graph. St000147The largest part of an integer partition. St000271The chromatic index of a graph. St000335The difference of lower and upper interactions. St000383The last part of an integer composition. St000443The number of long tunnels of a Dyck path. St000553The number of blocks of a graph. St000626The minimal period of a binary word. 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. St000765The number of weak records in an integer composition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000820The number of compositions obtained by rotating the composition. St000876The number of factors in the Catalan decomposition of a binary word. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the 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. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension 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. St001235The global dimension of the corresponding Comp-Nakayama algebra. 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. St001286The annihilation number of a graph. 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. St001313The number of Dyck paths above the lattice path given by a binary word. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001389The number of partitions of the same length below the given integer partition. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. 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). St001595The number of standard Young tableaux of the skew partition. St001780The order of promotion on the set of standard tableaux of given shape. St001809The index of the step at the first peak of maximal height in a Dyck path. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St000024The number of double up and double down steps of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. St000090The variation of a composition. St000091The descent variation of a composition. St000225Difference between largest and smallest parts in a partition. St000293The number of inversions of a binary word. St000312The number of leaves in a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000369The dinv deficit of a Dyck path. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000439The position of the first down step of a Dyck path. St000636The hull number of a graph. St000682The Grundy value of Welter's game on a binary word. St000766The number of inversions of an integer composition. St000877The depth of the binary word interpreted as a path. St000931The number of occurrences of the pattern UUU in a 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. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001176The size of a partition minus its first part. St001180Number of indecomposable injective modules with projective dimension at most 1. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing 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. 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. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001315The dissociation number of a graph. St001323The independence gap of a graph. St001435The number of missing boxes in the first row. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001438The number of missing boxes of a skew partition. 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. 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. St001578The minimal number of edges to add or remove to make a graph a line graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001742The difference of the maximal and the minimal degree in a graph. St001777The number of weak descents in an integer composition. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001883The mutual visibility number of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001108The 2-dynamic chromatic number of a graph. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000681The Grundy value of Chomp on Ferrers diagrams. St001199The dominant dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . 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. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000806The semiperimeter of the associated bargraph. St000656The number of cuts of a poset. 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. 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. 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. St000932The number of occurrences of the pattern UDU in a Dyck path. St000937The number of positive values of the symmetric group character corresponding to the partition. St000947The major index east count of a Dyck path. St001118The acyclic chromatic index of a graph. St001128The exponens consonantiae of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001498The normalised height of a Nakayama algebra with magnitude 1. St001570The minimal number of edges to add to make a graph Hamiltonian. St001959The product of the heights of the peaks of a Dyck path. St000420The number of Dyck paths that are weakly above a Dyck path. St000442The maximal area to the right of an up step of 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. St000874The position of the last double rise in a Dyck path. St000934The 2-degree of an integer partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. 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. St001060The distinguishing index of a graph. St001480The number of simple summands of the module J^2/J^3. St001808The box weight or horizontal decoration of a Dyck path. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000299The number of nonisomorphic vertex-induced subtrees. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of 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. St001624The breadth of a lattice. 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. St001512The minimum rank of a graph. St001845The number of join irreducibles minus the rank of a lattice. St001651The Frankl number of a lattice. St001871The number of triconnected components of a graph. St000699The toughness times the least common multiple of 1,. St001194The injective dimension of

$A/AfA$ in the corresponding Nakayama algebra

$A$ when

$Af$ is the minimal faithful projective-injective left

$A$ -module 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. St000955Number of times one has

$Ext^i(D(A),A)>0$ for

$i>0$ for the corresponding LNakayama algebra. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001592The maximal number of simple paths between any two different vertices 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. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. 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. St000264The girth of a graph, which is not a tree. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001545The second Elser number of a connected graph. St001195The global dimension of the algebra

$A/AfA$ of the corresponding Nakayama algebra

$A$ with minimal left faithful projective-injective module

$Af$ . St001645The pebbling number of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St001625The Möbius invariant of a lattice. St001330The hat guessing number of a graph. St000544The cop number of a graph. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001396Number of triples of incomparable elements in a finite poset. St001964The interval resolution global dimension of a poset. St001322The size of a minimal independent dominating set in a graph. St000422The energy of a graph, if it is integral. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000454The largest eigenvalue of a graph if it is integral. St001890The maximum magnitude of the Möbius function of a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001820The size of the image of the pop stack sorting operator. St001720The minimal length of a chain of small intervals in a lattice. St001846The number of elements which do not have a complement in the lattice. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition.