searching the database
Your data matches 596 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000093
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([],5)
=> 5 = 4 + 1
([(3,4)],5)
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([],6)
=> 6 = 5 + 1
([(4,5)],6)
=> 5 = 4 + 1
([(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
([],7)
=> 7 = 6 + 1
([(5,6)],7)
=> 6 = 5 + 1
([(4,5),(4,6),(5,6)],7)
=> 5 = 4 + 1
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3 = 2 + 1
([(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)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
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: St000273
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([],5)
=> 5 = 4 + 1
([(3,4)],5)
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([],6)
=> 6 = 5 + 1
([(4,5)],6)
=> 5 = 4 + 1
([(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
([],7)
=> 7 = 6 + 1
([(5,6)],7)
=> 6 = 5 + 1
([(4,5),(4,6),(5,6)],7)
=> 5 = 4 + 1
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3 = 2 + 1
([(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)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
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: St000544
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([],5)
=> 5 = 4 + 1
([(3,4)],5)
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([],6)
=> 6 = 5 + 1
([(4,5)],6)
=> 5 = 4 + 1
([(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
([],7)
=> 7 = 6 + 1
([(5,6)],7)
=> 6 = 5 + 1
([(4,5),(4,6),(5,6)],7)
=> 5 = 4 + 1
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3 = 2 + 1
([(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)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
Description
The cop number of a graph.
This is the minimal number of cops needed to catch the robber. The algorithm is from [2].
Matching statistic: St000786
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([],5)
=> 5 = 4 + 1
([(3,4)],5)
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([],6)
=> 6 = 5 + 1
([(4,5)],6)
=> 5 = 4 + 1
([(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
([],7)
=> 7 = 6 + 1
([(5,6)],7)
=> 6 = 5 + 1
([(4,5),(4,6),(5,6)],7)
=> 5 = 4 + 1
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3 = 2 + 1
([(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)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
Description
The maximal number of occurrences of a colour in a proper colouring of a graph.
To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the largest part occurring in any of these partitions.
For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$. Therefore, the statistic on this graph is $3$.
Matching statistic: St000916
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([],5)
=> 5 = 4 + 1
([(3,4)],5)
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([],6)
=> 6 = 5 + 1
([(4,5)],6)
=> 5 = 4 + 1
([(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
([],7)
=> 7 = 6 + 1
([(5,6)],7)
=> 6 = 5 + 1
([(4,5),(4,6),(5,6)],7)
=> 5 = 4 + 1
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3 = 2 + 1
([(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)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
Description
The packing number of a graph.
This is the size of a largest subset of vertices of a graph, such that any two distinct vertices in the subset have disjoint closed neighbourhoods, or, equivalently, have distance greater than two.
Matching statistic: St001829
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 2 = 1 + 1
([(0,1)],2)
=> 1 = 0 + 1
([],3)
=> 3 = 2 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([],4)
=> 4 = 3 + 1
([(2,3)],4)
=> 3 = 2 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([],5)
=> 5 = 4 + 1
([(3,4)],5)
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([],6)
=> 6 = 5 + 1
([(4,5)],6)
=> 5 = 4 + 1
([(3,4),(3,5),(4,5)],6)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
([],7)
=> 7 = 6 + 1
([(5,6)],7)
=> 6 = 5 + 1
([(4,5),(4,6),(5,6)],7)
=> 5 = 4 + 1
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3 = 2 + 1
([(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)
=> 2 = 1 + 1
([(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)
=> 1 = 0 + 1
Description
The common independence number of a graph.
The common independence number of a graph $G$ is the greatest integer $r$ such that every vertex of $G$ belongs to some independent set $X$ of vertices of cardinality at least $r$.
Matching statistic: St000272
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 0
([],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)
=> 5
([(4,5)],6)
=> ([(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)
=> 4
([(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
([(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
([],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)
=> 6
([(5,6)],7)
=> ([(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)
=> 5
([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(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)
=> 4
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 2
([(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,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
([(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
Description
The treewidth of a graph.
A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
Matching statistic: St000362
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 0
([],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)
=> 5
([(4,5)],6)
=> ([(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)
=> 4
([(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
([(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
([],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)
=> 6
([(5,6)],7)
=> ([(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)
=> 5
([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(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)
=> 4
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 2
([(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,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
([(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
Description
The size of a minimal vertex cover 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$. Finding a minimal vertex cover is an NP-hard optimization problem.
Matching statistic: St000536
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1)],2)
=> 1
([(0,1)],2)
=> ([],2)
=> 0
([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 0
([],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)
=> 5
([(4,5)],6)
=> ([(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)
=> 4
([(3,4),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
([(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
([],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)
=> 6
([(5,6)],7)
=> ([(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)
=> 5
([(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,4),(0,5),(0,6),(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)
=> 4
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 3
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 2
([(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,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
([(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
Description
The pathwidth of a graph.
Matching statistic: St000778
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([],2)
=> 1
([(0,1)],2)
=> ([],1)
=> 0
([],3)
=> ([],3)
=> 2
([(1,2)],3)
=> ([],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
([],4)
=> ([],4)
=> 3
([(2,3)],4)
=> ([],3)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([],2)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
([],5)
=> ([],5)
=> 4
([(3,4)],5)
=> ([],4)
=> 3
([(2,3),(2,4),(3,4)],5)
=> ([],3)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],2)
=> 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
([],6)
=> ([],6)
=> 5
([(4,5)],6)
=> ([],5)
=> 4
([(3,4),(3,5),(4,5)],6)
=> ([],4)
=> 3
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],3)
=> 2
([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([],2)
=> 1
([(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)
=> ([],1)
=> 0
([],7)
=> ([],7)
=> 6
([(5,6)],7)
=> ([],6)
=> 5
([(4,5),(4,6),(5,6)],7)
=> ([],5)
=> 4
([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([],4)
=> 3
([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([],3)
=> 2
([(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)
=> ([],2)
=> 1
([(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)
=> ([],1)
=> 0
Description
The metric dimension of a graph.
This is the length of the shortest vector of vertices, such that every vertex is uniquely determined by the vector of distances from these vertices.
The following 586 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001176The size of a partition minus its first part. St001340The cardinality of a minimal non-edge isolating set of a graph. St001949The rigidity index of a graph. St000010The length of the partition. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000172The Grundy number of a graph. St000258The burning number of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000469The distinguishing number of a graph. St000479The Ramsey number of a graph. St000482The (zero)-forcing number of a graph. St000636The hull number of a graph. St000722The number of different neighbourhoods in a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000808The number of up steps of the associated bargraph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000926The clique-coclique number of a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001029The size of the core of a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001286The annihilation number of a graph. 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. 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. St001342The number of vertices in the center of a graph. St001363The Euler characteristic of a graph according to Knill. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001441The number of non-empty connected induced subgraphs of a graph. St001463The number of distinct columns in the nullspace of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a 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. St001672The restrained domination number of a graph. St001691The number of kings in a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St000012The area of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000148The number of odd parts of a partition. St000157The number of descents of a standard tableau. St000160The multiplicity of the smallest part of a partition. St000171The degree of the graph. St000228The size of a partition. St000293The number of inversions of a binary word. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000377The dinv defect of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000454The largest eigenvalue of a graph if it is integral. St000459The hook length of the base cell of a partition. St000475The number of parts equal to 1 in a partition. St000519The largest length of a factor maximising the subword complexity. St000548The number of different non-empty partial sums of an integer partition. St000632The jump number of the poset. St000784The maximum of the length and the largest part of the integer partition. St000867The sum of the hook lengths in the first row of an integer partition. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001091The number of parts in an integer partition whose next smaller part has the same size. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001127The sum of the squares of the parts of a partition. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. 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. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001644The dimension of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001777The number of weak descents in an integer composition. St001918The degree of the cyclic sieving polynomial corresponding to an integer 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. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000063The number of linear extensions of a certain poset defined for an integer partition. St000068The number of minimal elements in a poset. St000069The number of maximal elements of a poset. St000071The number of maximal chains in a poset. St000108The number of partitions contained in the given partition. St000147The largest part of an integer partition. St000271The chromatic index of a graph. St000288The number of ones in a binary word. St000363The number of minimal vertex covers of a graph. St000378The diagonal inversion number of an integer partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000527The width of the poset. St000531The leading coefficient of the rook polynomial of an integer partition. St000532The total number of rook placements on a Ferrers board. St000657The smallest part of an integer composition. St000733The row containing the largest entry of a standard tableau. St000738The first entry in the last row of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000876The number of factors in the Catalan decomposition of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St000908The length of the shortest maximal antichain in a poset. St000909The number of maximal chains of maximal size in a poset. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. 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. St001268The size of the largest ordinal summand in the poset. St001330The hat guessing number of a graph. St001360The number of covering relations in Young's lattice below a partition. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001389The number of partitions of the same length below the given integer partition. St001399The distinguishing number of a poset. St001400The total number of Littlewood-Richardson tableaux of given shape. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001645The pebbling number of a connected graph. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. 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. St001779The order of promotion on the set of linear extensions of a poset. St001809The index of the step at the first peak of maximal height in a Dyck path. St001883The mutual visibility number of a graph. St001933The largest multiplicity of a part in an integer partition. St000300The number of independent sets of vertices of a graph. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000439The position of the first down step 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. St001664The number of non-isomorphic subposets of a poset. St001814The number of partitions interlacing the given partition. St000008The major index of the composition. St000019The cardinality of the support of a permutation. St000041The number of nestings of a perfect matching. St000053The number of valleys of the Dyck path. St000141The maximum drop size of a permutation. St000145The Dyson rank of a partition. St000214The number of adjacencies of a permutation. St000290The major index of a binary word. St000392The length of the longest run of ones in a binary word. St000546The number of global descents of a permutation. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000662The staircase size of the code of a permutation. St000682The Grundy value of Welter's game on a binary word. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000921The number of internal inversions of a binary word. St000992The alternating sum of the parts of an integer partition. St000996The number of exclusive left-to-right maxima of a permutation. St001034The area of the parallelogram polyomino associated with the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001090The number of pop-stack-sorts needed to sort a permutation. St001161The major index north count of a Dyck path. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001372The length of a longest cyclic run of ones of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001485The modular major index of a binary word. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St000007The number of saliances of the permutation. St000011The number of touch points (or returns) of a Dyck path. St000054The first entry of the permutation. St000058The order of a permutation. St000105The number of blocks in the set partition. St000184The size of the centralizer of any permutation of given cycle type. St000297The number of leading ones in a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000393The number of strictly increasing runs in a binary word. St000507The number of ascents of a standard tableau. St000667The greatest common divisor of the parts of the partition. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000734The last entry in the first row of a standard tableau. St000839The largest opener of a set partition. St000883The number of longest increasing subsequences of a permutation. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000982The length of the longest constant subword. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001050The number of terminal closers of a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001135The projective dimension of the first simple module in the Nakayama 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:
St001267The length of the Lyndon factorization of the binary word. St001312Number of parabolic noncrossing partitions indexed by the composition. St001313The number of Dyck paths above the lattice path given by a binary word. St001415The length of the longest palindromic prefix of a binary word. St001437The flex of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001675The number of parts equal to the part in the reversed composition. St001733The number of weak left to right maxima of a Dyck path. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. 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}$. St001028Number of simple modules with injective dimension equal to the dominant dimension 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. St000806The semiperimeter of the associated bargraph. St000087The number of induced subgraphs. St000287The number of connected components of a graph. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000553The number of blocks of a graph. St001828The Euler characteristic of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000442The maximal area to the right of an up step of a Dyck path. St000741The Colin de Verdière graph invariant. St000874The position of the last double rise in a Dyck path. St000984The number of boxes below precisely one peak. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001323The independence gap 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. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001962The proper pathwidth of a graph. St000081The number of edges of a graph. St000189The number of elements in the poset. St000286The number of connected components of the complement of a graph. St000444The length of the maximal rise of a Dyck path. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000822The Hadwiger number of the graph. St001118The acyclic chromatic index of a graph. 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. St001345The Hamming dimension of a graph. St001479The number of bridges of a graph. St001725The harmonious chromatic number of a graph. St001826The maximal number of leaves on a vertex of a graph. St001917The order of toric promotion on the set of labellings of a graph. St001963The tree-depth of a graph. St000180The number of chains of a poset. St000301The number of facets of the stable set polytope of a graph. St000468The Hosoya index of a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000915The Ore degree of a graph. St001674The number of vertices of the largest induced star graph in the graph. St000209Maximum difference of elements in cycles. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000446The disorder of a permutation. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000503The maximal difference between two elements in a common block. St000728The dimension of a set partition. St000730The maximal arc length of a set partition. St000932The number of occurrences of the pattern UDU in a Dyck path. St000946The sum of the skew hook positions in a Dyck path. St000947The major index east count of a Dyck path. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001726The number of visible inversions of a permutation. St000420The number of Dyck paths that are weakly above a Dyck path. St000617The number of global maxima of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000925The number of topologically connected components of a set partition. 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. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001808The box weight or horizontal decoration of a Dyck path. St000809The reduced reflection length of the permutation. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St000989The number of final rises of a permutation. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St000485The length of the longest cycle of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St001834The number of non-isomorphic minors of a graph. St001742The difference of the maximal and the minimal degree in a graph. St001812The biclique partition number of a graph. St000181The number of connected components of the Hasse diagram for the poset. St001117The game chromatic index of a graph. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St000086The number of subgraphs. St000299The number of nonisomorphic vertex-induced subtrees. St000161The sum of the sizes of the right subtrees of a binary tree. St000306The bounce count of a Dyck path. St000006The dinv of a Dyck path. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000770The major index of an integer partition when read from bottom to top. St000018The number of inversions of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000237The number of small exceedances. St000110The number of permutations less than or equal to a permutation in left weak order. St000993The multiplicity of the largest part of an integer partition. St001279The sum of the parts of an integer partition that are at least two. St000246The number of non-inversions of a permutation. St000651The maximal size of a rise in a permutation. 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. St000864The number of circled entries of the shifted recording tableau of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St000213The number of weak exceedances (also weak excedences) of a permutation. St000314The number of left-to-right-maxima of a permutation. St000339The maf index of a permutation. St000470The number of runs in a permutation. St000501The size of the first part in the decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000653The last descent of a permutation. St001480The number of simple summands of the module J^2/J^3. St001497The position of the largest weak excedence of a permutation. St001622The number of join-irreducible elements of a lattice. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000089The absolute variation of a composition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000681The Grundy value of Chomp on Ferrers diagrams. St001175The size of a partition minus the hook length of the base cell. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St000146The Andrews-Garvan crank of a partition. St000335The difference of lower and upper interactions. St000443The number of long tunnels of a Dyck path. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. 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. St001280The number of parts of an integer partition that are at least two. St001498The normalised height of a Nakayama algebra with magnitude 1. 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. St000656The number of cuts of a poset. St000005The bounce statistic of a Dyck path. St000021The number of descents of a permutation. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000057The Shynar inversion number of a standard tableau. St000067The inversion number of the alternating sign matrix. St000076The rank of the alternating sign matrix in the alternating sign matrix poset. St000090The variation of a composition. St000091The descent variation of a composition. St000120The number of left tunnels of a Dyck path. St000155The number of exceedances (also excedences) of a permutation. St000224The sorting index of a permutation. St000238The number of indices that are not small weak excedances. St000296The length of the symmetric border of a binary word. St000316The number of non-left-to-right-maxima of a permutation. St000331The number of upper interactions of a Dyck path. St000354The number of recoils of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000627The exponent of a binary word. St000766The number of inversions of an integer composition. St000795The mad of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000878The number of ones minus the number of zeros of a binary word. St000922The minimal number such that all substrings of this length are unique. St001061The number of indices that are both descents and recoils of a permutation. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. 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$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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$. 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. 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. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. 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. 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. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001523The degree of symmetry of a Dyck path. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001884The number of borders of a binary word. St000015The number of peaks of a Dyck path. St000240The number of indices that are not small excedances. St000294The number of distinct factors of a binary word. St000295The length of the border of a binary word. St000325The width of the tree associated to a permutation. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000395The sum of the heights of the peaks of a Dyck path. St000477The weight of a partition according to Alladi. St000518The number of distinct subsequences in a binary word. St000529The number of permutations whose descent word is the given binary word. St000543The size of the conjugacy class of a binary word. St000626The minimal period of a binary word. St000654The first descent of a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000820The number of compositions obtained by rotating the composition. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000990The first ascent of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of 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. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. 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. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001481The minimal height of a peak of a Dyck path. 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. St001530The depth of a Dyck path. St001658The total number of rook placements on a Ferrers board. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001955The number of natural descents for set-valued two row standard Young tableaux. St000438The position of the last up step in a Dyck path. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001838The number of nonempty primitive factors of a binary word. St001959The product of the heights of the peaks of a Dyck path. St000216The absolute length of a permutation. 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. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. 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. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St000014The number of parking functions supported by a Dyck path. St000082The number of elements smaller than a binary tree in Tamari order. St000144The pyramid weight of 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. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. 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. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001346The number of parking functions that give the same permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 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. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001259The vector space dimension of the double dual of D(A) in the corresponding Nakayama algebra. St001706The number of closed sets in a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001060The distinguishing index of a graph. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. 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). St001613The binary logarithm of the size of the center of a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000710The number of big deficiencies of a permutation. St001152The number of pairs with even minimum in a perfect matching. St001684The reduced word complexity of a permutation. St000744The length of the path to the largest entry in a standard Young tableau. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001621The number of atoms of a lattice. St001624The breadth of a lattice. 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. 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. St001638The book thickness of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000455The second largest eigenvalue of a graph if it is integral. St001578The minimal number of edges to add or remove to make a graph a line graph. St000937The number of positive values of the symmetric group character corresponding to the partition. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. 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$. St001651The Frankl number of a lattice. 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. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another 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. St000699The toughness times the least common multiple of 1,. St000456The monochromatic index of a connected graph. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000944The 3-degree of an integer partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001248Sum of the even parts of a partition. St001541The Gini index of an integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001877Number of indecomposable injective modules with projective dimension 2. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000618The number of self-evacuating tableaux of given shape. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001432The order dimension of the partition. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001780The order of promotion on the set of standard tableaux of given shape. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St001875The number of simple modules with projective dimension at most 1. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000934The 2-degree of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. 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. St000284The Plancherel distribution on integer partitions. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000707The product of the factorials of the parts. St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001128The exponens consonantiae of a partition. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001568The smallest positive integer that does not appear twice in the partition. St000264The girth of a graph, which is not a tree. St001281The normalized isoperimetric number of a graph. St000379The number of Hamiltonian cycles in a graph. St001890The maximum magnitude of the Möbius function of a poset.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!