searching the database
Your data matches 27 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: St001257
(load all 27 compositions to match this statistic)
(load all 27 compositions to match this statistic)
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001257: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001257: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
Description
The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J.
Matching statistic: St000908
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000908: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00065: Permutations —permutation poset⟶ Posets
St000908: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 1
[1,0,1,0]
=> [1,2] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [2,1] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => ([(0,1),(0,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,1,2] => ([(1,2)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(0,2),(0,3),(3,1)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(1,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => ([(0,3),(1,2),(1,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(0,3),(3,4),(4,1),(4,2)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(0,4),(3,2),(4,1),(4,3)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => ([(0,4),(3,2),(4,1),(4,3)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(0,2),(0,4),(3,1),(4,3)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => ([(0,3),(0,4),(3,2),(4,1)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => ([(0,2),(0,4),(3,1),(4,3)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => ([(0,4),(1,4),(2,3),(4,2)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(0,4),(1,2),(2,4),(4,3)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,2),(2,3),(2,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => ([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,4),(2,3)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,2),(1,4),(4,3)],5)
=> 2
Description
The length of the shortest maximal antichain in a poset.
Matching statistic: St001271
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001271: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St001271: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 0 = 1 - 1
[1,0,1,0]
=> [1,2] => ([],2)
=> 0 = 1 - 1
[1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => ([],5)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
Description
The competition number of a graph.
The competition graph of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) is the smallest number of such isolated vertices.
Matching statistic: St000273
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => ([],1)
=> 1
[1,0,1,0]
=> [1,2] => [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [2,1] => [1,2] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,3,2] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => ([(1,2)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,5,4,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [5,2,4,3,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,2,5,3,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [3,5,2,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [3,2,5,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,5,4,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [4,5,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [5,3,1,4,2] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,1,5,4,2] => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
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: St001316
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St001316: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00065: Permutations —permutation poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St001316: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([],2)
=> ([],2)
=> 1
[1,1,0,0]
=> [1,2] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
[1,0,1,0,1,0]
=> [3,2,1] => ([],3)
=> ([],3)
=> 1
[1,0,1,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([],4)
=> ([],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(2,3)],4)
=> ([(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(2,3)],4)
=> ([(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(2,3)],4)
=> ([(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([],5)
=> ([],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(3,4)],5)
=> ([(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(3,4)],5)
=> ([(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(3,4)],5)
=> ([(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(3,4)],5)
=> ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
Description
The domatic number of a graph.
This is the maximal size of a partition of the vertices into dominating sets.
Matching statistic: St001322
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001322: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001322: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => ([],1)
=> 1
[1,0,1,0]
=> [1,2] => [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [2,1] => [1,2] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,3,2] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => ([(1,2)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,5,4,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [5,2,4,3,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,2,5,3,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [3,5,2,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [3,2,5,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,5,4,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [4,5,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [5,3,1,4,2] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,1,5,4,2] => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
Description
The size of a minimal independent dominating set in a graph.
Matching statistic: St001339
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001339: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001339: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => ([],1)
=> 1
[1,0,1,0]
=> [1,2] => [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [2,1] => [1,2] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,3,2] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => ([(1,2)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,5,4,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [5,2,4,3,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,2,5,3,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [3,5,2,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [3,2,5,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,5,4,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [4,5,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [5,3,1,4,2] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,1,5,4,2] => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
Description
The irredundance number of a graph.
A set S of vertices is irredundant, if there is no vertex in S, whose closed neighbourhood is contained in the union of the closed neighbourhoods of the other vertices of S.
The irredundance number is the smallest size of a maximal irredundant set.
Matching statistic: St001481
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00005: Alternating sign matrices —transpose⟶ Alternating sign matrices
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
St001481: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00005: Alternating sign matrices —transpose⟶ Alternating sign matrices
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
St001481: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [[1]]
=> [1,0]
=> 1
[1,0,1,0]
=> [[1,0],[0,1]]
=> [[1,0],[0,1]]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [[0,1],[1,0]]
=> [[0,1],[1,0]]
=> [1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [[0,1,0],[0,0,1],[1,0,0]]
=> [1,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [[1,0,0,0],[0,0,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [[0,1,0,0],[0,0,1,0],[1,0,0,0],[0,0,0,1]]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,0,0,1,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
Description
The minimal height of a peak of a Dyck path.
Matching statistic: St001829
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001829: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001829: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => ([],1)
=> 1
[1,0,1,0]
=> [1,2] => [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [2,1] => [1,2] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,3,2] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => ([(1,2)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,5,4,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [5,2,4,3,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,2,5,3,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [3,5,2,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [3,2,5,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,5,4,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [4,5,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [5,3,1,4,2] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,1,5,4,2] => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
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: St000310
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000310: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00065: Permutations —permutation poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000310: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 0 = 1 - 1
[1,0,1,0]
=> [2,1] => ([],2)
=> ([],2)
=> 0 = 1 - 1
[1,1,0,0]
=> [1,2] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [3,2,1] => ([],3)
=> ([],3)
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> ([(1,2)],3)
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([],4)
=> ([],4)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(2,3)],4)
=> ([(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(2,3)],4)
=> ([(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(2,3)],4)
=> ([(2,3)],4)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([],5)
=> ([],5)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(3,4)],5)
=> ([(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(3,4)],5)
=> ([(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(3,4)],5)
=> ([(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(2,3),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(1,4),(2,4),(4,3)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(3,4)],5)
=> ([(3,4)],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(0,4),(1,3),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
Description
The minimal degree of a vertex of a graph.
The following 17 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000674The number of hills of a Dyck path. St000906The length of the shortest maximal chain in a poset. St001691The number of kings in a 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. St000260The radius of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001198The number of simple modules in the algebra eAe with projective dimension at most 1 in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001206The maximal dimension of an indecomposable projective eAe-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module eA. St000456The monochromatic index of a connected graph. St000461The rix statistic of a permutation. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn−1] such that n=c0<ci for all i>0 a special CNakayama algebra. St001545The second Elser number of a connected graph. St000264The girth of a graph, which is not a tree. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition.
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!