- FindStat

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

Matching statistic: St000722
(load all 3 compositions to match this statistic)

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000722: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 1
1 => [1] => ([],1)
 => ([],1)
 => 1
00 => [2] => ([],2)
 => ([],1)
 => 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
11 => [2] => ([],2)
 => ([],1)
 => 1
000 => [3] => ([],3)
 => ([],1)
 => 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
111 => [3] => ([],3)
 => ([],1)
 => 1
0000 => [4] => ([],4)
 => ([],1)
 => 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
1111 => [4] => ([],4)
 => ([],1)
 => 1
00000 => [5] => ([],5)
 => ([],1)
 => 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
11111 => [5] => ([],5)
 => ([],1)
 => 1
000000 => [6] => ([],6)
 => ([],1)
 => 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
010101 => [1,1,1,1,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)
 => ([(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
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
101010 => [1,1,1,1,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)
 => ([(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
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
111111 => [6] => ([],6)
 => ([],1)
 => 1
0000000 => [7] => ([],7)
 => ([],1)
 => 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 2
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 6

Description

The number of different neighbourhoods in a graph.

Matching statistic: St001645
(load all 3 compositions to match this statistic)

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001645: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 1
1 => [1] => ([],1)
 => ([],1)
 => 1
00 => [2] => ([],2)
 => ([],1)
 => 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
11 => [2] => ([],2)
 => ([],1)
 => 1
000 => [3] => ([],3)
 => ([],1)
 => 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
111 => [3] => ([],3)
 => ([],1)
 => 1
0000 => [4] => ([],4)
 => ([],1)
 => 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
1111 => [4] => ([],4)
 => ([],1)
 => 1
00000 => [5] => ([],5)
 => ([],1)
 => 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
11111 => [5] => ([],5)
 => ([],1)
 => 1
000000 => [6] => ([],6)
 => ([],1)
 => 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
010101 => [1,1,1,1,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)
 => ([(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
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
101010 => [1,1,1,1,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)
 => ([(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
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
111111 => [6] => ([],6)
 => ([],1)
 => 1
0000000 => [7] => ([],7)
 => ([],1)
 => 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 2
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 6

Description

The pebbling number of a connected graph.

Matching statistic: St001707

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001707: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 1
1 => [1] => ([],1)
 => ([],1)
 => 1
00 => [2] => ([],2)
 => ([],1)
 => 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
11 => [2] => ([],2)
 => ([],1)
 => 1
000 => [3] => ([],3)
 => ([],1)
 => 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
111 => [3] => ([],3)
 => ([],1)
 => 1
0000 => [4] => ([],4)
 => ([],1)
 => 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
1111 => [4] => ([],4)
 => ([],1)
 => 1
00000 => [5] => ([],5)
 => ([],1)
 => 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
11111 => [5] => ([],5)
 => ([],1)
 => 1
000000 => [6] => ([],6)
 => ([],1)
 => 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
010101 => [1,1,1,1,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)
 => ([(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
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
101010 => [1,1,1,1,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)
 => ([(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
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
111111 => [6] => ([],6)
 => ([],1)
 => 1
0000000 => [7] => ([],7)
 => ([],1)
 => 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 2
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 6

Description

The 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. Such a partition always exists because of a construction due to Dudek and Pralat [1] and independently Pokrovskiy [2].

Matching statistic: St001746

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001746: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 1
1 => [1] => ([],1)
 => ([],1)
 => 1
00 => [2] => ([],2)
 => ([],1)
 => 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
11 => [2] => ([],2)
 => ([],1)
 => 1
000 => [3] => ([],3)
 => ([],1)
 => 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
111 => [3] => ([],3)
 => ([],1)
 => 1
0000 => [4] => ([],4)
 => ([],1)
 => 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
1111 => [4] => ([],4)
 => ([],1)
 => 1
00000 => [5] => ([],5)
 => ([],1)
 => 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
11111 => [5] => ([],5)
 => ([],1)
 => 1
000000 => [6] => ([],6)
 => ([],1)
 => 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
010101 => [1,1,1,1,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)
 => ([(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
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
101010 => [1,1,1,1,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)
 => ([(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
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
111111 => [6] => ([],6)
 => ([],1)
 => 1
0000000 => [7] => ([],7)
 => ([],1)
 => 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 2
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 6

Description

The coalition number of a graph. This is the maximal cardinality of a set partition such that each block is either a dominating set of cardinality one, or is not a dominating set but can be joined with a second block to form a dominating set.

Matching statistic: St000171

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000171: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 0 = 1 - 1
1 => [1] => ([],1)
 => ([],1)
 => 0 = 1 - 1
00 => [2] => ([],2)
 => ([],1)
 => 0 = 1 - 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
11 => [2] => ([],2)
 => ([],1)
 => 0 = 1 - 1
000 => [3] => ([],3)
 => ([],1)
 => 0 = 1 - 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 2 - 1
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 2 - 1
111 => [3] => ([],3)
 => ([],1)
 => 0 = 1 - 1
0000 => [4] => ([],4)
 => ([],1)
 => 0 = 1 - 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 2 - 1
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 2 - 1
1111 => [4] => ([],4)
 => ([],1)
 => 0 = 1 - 1
00000 => [5] => ([],5)
 => ([],1)
 => 0 = 1 - 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 2 - 1
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 2 - 1
11111 => [5] => ([],5)
 => ([],1)
 => 0 = 1 - 1
000000 => [6] => ([],6)
 => ([],1)
 => 0 = 1 - 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 1 = 2 - 1
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
010101 => [1,1,1,1,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)
 => ([(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 = 6 - 1
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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 = 6 - 1
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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 = 6 - 1
101010 => [1,1,1,1,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)
 => ([(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 = 6 - 1
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 1 = 2 - 1
111111 => [6] => ([],6)
 => ([],1)
 => 0 = 1 - 1
0000000 => [7] => ([],7)
 => ([],1)
 => 0 = 1 - 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 1 = 2 - 1
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 5 = 6 - 1

Description

The degree of the graph. This is the maximal vertex degree of a graph.

Matching statistic: St000987

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000987: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 0 = 1 - 1
1 => [1] => ([],1)
 => ([],1)
 => 0 = 1 - 1
00 => [2] => ([],2)
 => ([],1)
 => 0 = 1 - 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
11 => [2] => ([],2)
 => ([],1)
 => 0 = 1 - 1
000 => [3] => ([],3)
 => ([],1)
 => 0 = 1 - 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 2 - 1
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 2 - 1
111 => [3] => ([],3)
 => ([],1)
 => 0 = 1 - 1
0000 => [4] => ([],4)
 => ([],1)
 => 0 = 1 - 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 2 - 1
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 2 - 1
1111 => [4] => ([],4)
 => ([],1)
 => 0 = 1 - 1
00000 => [5] => ([],5)
 => ([],1)
 => 0 = 1 - 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 2 - 1
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 2 - 1
11111 => [5] => ([],5)
 => ([],1)
 => 0 = 1 - 1
000000 => [6] => ([],6)
 => ([],1)
 => 0 = 1 - 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 1 = 2 - 1
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
010101 => [1,1,1,1,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)
 => ([(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 = 6 - 1
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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 = 6 - 1
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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 = 6 - 1
101010 => [1,1,1,1,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)
 => ([(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 = 6 - 1
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 1 = 2 - 1
111111 => [6] => ([],6)
 => ([],1)
 => 0 = 1 - 1
0000000 => [7] => ([],7)
 => ([],1)
 => 0 = 1 - 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 1 = 2 - 1
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 5 = 6 - 1

Description

The number of positive eigenvalues of the Laplacian matrix of the graph. This is the number of vertices minus the number of connected components of the graph.

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

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001120: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 0 = 1 - 1
1 => [1] => ([],1)
 => ([],1)
 => 0 = 1 - 1
00 => [2] => ([],2)
 => ([],1)
 => 0 = 1 - 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 2 - 1
11 => [2] => ([],2)
 => ([],1)
 => 0 = 1 - 1
000 => [3] => ([],3)
 => ([],1)
 => 0 = 1 - 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 2 - 1
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 2 - 1
111 => [3] => ([],3)
 => ([],1)
 => 0 = 1 - 1
0000 => [4] => ([],4)
 => ([],1)
 => 0 = 1 - 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 2 - 1
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 2 - 1
1111 => [4] => ([],4)
 => ([],1)
 => 0 = 1 - 1
00000 => [5] => ([],5)
 => ([],1)
 => 0 = 1 - 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 2 - 1
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 2 - 1
11111 => [5] => ([],5)
 => ([],1)
 => 0 = 1 - 1
000000 => [6] => ([],6)
 => ([],1)
 => 0 = 1 - 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 1 = 2 - 1
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
010101 => [1,1,1,1,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)
 => ([(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 = 6 - 1
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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 = 6 - 1
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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 = 6 - 1
101010 => [1,1,1,1,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)
 => ([(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 = 6 - 1
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 1 = 2 - 1
111111 => [6] => ([],6)
 => ([],1)
 => 0 = 1 - 1
0000000 => [7] => ([],7)
 => ([],1)
 => 0 = 1 - 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 1 = 2 - 1
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 2 = 3 - 1
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4 = 5 - 1
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 5 = 6 - 1

Description

The length of a longest path in a graph.

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

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001504: Dyck paths ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%

Values

0 => [1] => [1] => [1,0]
 => 2 = 1 + 1
1 => [1] => [1] => [1,0]
 => 2 = 1 + 1
00 => [2] => [1,1] => [1,0,1,0]
 => 2 = 1 + 1
01 => [1,1] => [2] => [1,1,0,0]
 => 3 = 2 + 1
10 => [1,1] => [2] => [1,1,0,0]
 => 3 = 2 + 1
11 => [2] => [1,1] => [1,0,1,0]
 => 2 = 1 + 1
000 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 2 = 1 + 1
001 => [2,1] => [2,1] => [1,1,0,0,1,0]
 => 3 = 2 + 1
010 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 4 = 3 + 1
101 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 4 = 3 + 1
110 => [2,1] => [2,1] => [1,1,0,0,1,0]
 => 3 = 2 + 1
111 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 2 = 1 + 1
0000 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
0001 => [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3 = 2 + 1
0010 => [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
 => 4 = 3 + 1
0101 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 5 = 4 + 1
1010 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 5 = 4 + 1
1101 => [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
 => 4 = 3 + 1
1110 => [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3 = 2 + 1
1111 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
00000 => [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
00001 => [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 3 = 2 + 1
00010 => [3,1,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 4 = 3 + 1
00101 => [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 5 = 4 + 1
01010 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 6 = 5 + 1
10101 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 6 = 5 + 1
11010 => [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 5 = 4 + 1
11101 => [3,1,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 4 = 3 + 1
11110 => [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 3 = 2 + 1
11111 => [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
000000 => [6] => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
000001 => [5,1] => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 3 = 2 + 1
000010 => [4,1,1] => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 4 = 3 + 1
000101 => [3,1,1,1] => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 5 = 4 + 1
001010 => [2,1,1,1,1] => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 6 = 5 + 1
010101 => [1,1,1,1,1,1] => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 7 = 6 + 1
011010 => [1,2,1,1,1] => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 7 = 6 + 1
100101 => [1,2,1,1,1] => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 7 = 6 + 1
101010 => [1,1,1,1,1,1] => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 7 = 6 + 1
110101 => [2,1,1,1,1] => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 6 = 5 + 1
111010 => [3,1,1,1] => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 5 = 4 + 1
111101 => [4,1,1] => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 4 = 3 + 1
111110 => [5,1] => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 3 = 2 + 1
111111 => [6] => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
0000000 => [7] => [1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
0000001 => [6,1] => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
 => 3 = 2 + 1
0000010 => [5,1,1] => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
 => 4 = 3 + 1
0000101 => [4,1,1,1] => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
 => 5 = 4 + 1
0001010 => [3,1,1,1,1] => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
 => 6 = 5 + 1
0010101 => [2,1,1,1,1,1] => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
 => 7 = 6 + 1
00001010 => [4,1,1,1,1] => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 5 + 1
11110101 => [4,1,1,1,1] => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 5 + 1

Description

The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path.

Matching statistic: St001725
(load all 3 compositions to match this statistic)

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001725: Graphs ⟶ ℤResult quality: 86% ●values known / values provided: 91%●distinct values known / distinct values provided: 86%

Values

0 => [1] => ([],1)
 => ([],1)
 => 1
1 => [1] => ([],1)
 => ([],1)
 => 1
00 => [2] => ([],2)
 => ([],1)
 => 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
11 => [2] => ([],2)
 => ([],1)
 => 1
000 => [3] => ([],3)
 => ([],1)
 => 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
111 => [3] => ([],3)
 => ([],1)
 => 1
0000 => [4] => ([],4)
 => ([],1)
 => 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
1111 => [4] => ([],4)
 => ([],1)
 => 1
00000 => [5] => ([],5)
 => ([],1)
 => 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
11111 => [5] => ([],5)
 => ([],1)
 => 1
000000 => [6] => ([],6)
 => ([],1)
 => 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
010101 => [1,1,1,1,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)
 => ([(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
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
101010 => [1,1,1,1,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)
 => ([(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
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
111111 => [6] => ([],6)
 => ([],1)
 => 1
0000000 => [7] => ([],7)
 => ([],1)
 => 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 2
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 6
0100101 => [1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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
0101010 => [1,1,1,1,1,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)
 => ([(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
0110101 => [1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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
1001010 => [1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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
1010101 => [1,1,1,1,1,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)
 => ([(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
1011010 => [1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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

Description

The harmonious chromatic number of a graph. A harmonious colouring is a proper vertex colouring such that any pair of colours appears at most once on adjacent vertices.

Matching statistic: St001330
(load all 12 compositions to match this statistic)

Mapping

Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001330: Graphs ⟶ ℤResult quality: 85% ●values known / values provided: 85%●distinct values known / distinct values provided: 100%

Values

0 => [1] => ([],1)
 => ([],1)
 => 1
1 => [1] => ([],1)
 => ([],1)
 => 1
00 => [2] => ([],2)
 => ([],1)
 => 1
01 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
10 => [1,1] => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
11 => [2] => ([],2)
 => ([],1)
 => 1
000 => [3] => ([],3)
 => ([],1)
 => 1
001 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
110 => [2,1] => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 2
111 => [3] => ([],3)
 => ([],1)
 => 1
0000 => [4] => ([],4)
 => ([],1)
 => 1
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1010 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 2
1111 => [4] => ([],4)
 => ([],1)
 => 1
00000 => [5] => ([],5)
 => ([],1)
 => 1
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
01010 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
10101 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 2
11111 => [5] => ([],5)
 => ([],1)
 => 1
000000 => [6] => ([],6)
 => ([],1)
 => 1
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
000101 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
001010 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
010101 => [1,1,1,1,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)
 => ([(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
011010 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
100101 => [1,2,1,1,1] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,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
101010 => [1,1,1,1,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)
 => ([(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
110101 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
111010 => [3,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 2
111111 => [6] => ([],6)
 => ([],1)
 => 1
0000000 => [7] => ([],7)
 => ([],1)
 => 1
0000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 2
0000010 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(1,2)],3)
 => 3
0000101 => [4,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
0001010 => [3,1,1,1,1] => ([(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)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
0010101 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 6
0011010 => [2,2,1,1,1] => ([(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)
 => ([(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
0100101 => [1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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
0101010 => [1,1,1,1,1,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)
 => ([(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
0110101 => [1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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
0111010 => [1,3,1,1,1] => ([(0,4),(0,5),(0,6),(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,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
1000101 => [1,3,1,1,1] => ([(0,4),(0,5),(0,6),(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,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
1001010 => [1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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
1010101 => [1,1,1,1,1,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)
 => ([(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
1011010 => [1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ([(0,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
1100101 => [2,2,1,1,1] => ([(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)
 => ([(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

Description

The hat guessing number of a graph. Suppose that each vertex of a graph corresponds to a player, wearing a hat whose color is arbitrarily chosen from a set of

$q$ possible colors. Each player can see the hat colors of his neighbors, but not his own hat color. All of the players are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The hat guessing number

$HG(G)$ of a graph

$G$ is the largest integer

$q$ such that there exists a guessing strategy guaranteeing at least one correct guess for any hat assignment of

$q$ possible colors. Because it suffices that a single player guesses correctly, the hat guessing number of a graph is the maximum of the hat guessing numbers of its connected components.

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

St000454The largest eigenvalue of a graph if it is integral. St001644The dimension of a graph. St000010The length of the partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St001812The biclique partition number of a graph. St000141The maximum drop size of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000451The length of the longest pattern of the form k 1 2. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. 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. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000159The number of distinct parts of the integer partition. St000653The last descent of a permutation. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by

$\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001480The number of simple summands of the module J^2/J^3. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph 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. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001458The rank of the adjacency matrix of a graph. St001963The tree-depth of a graph. St000356The number of occurrences of the pattern 13-2. St001083The number of boxed occurrences of 132 in a permutation. St000225Difference between largest and smallest parts in a partition. St000670The reversal length of a permutation. St000015The number of peaks of a Dyck path. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000316The number of non-left-to-right-maxima of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000702The number of weak deficiencies of a permutation. St000797The stat`` of a permutation. St000798The makl of a permutation. St000833The comajor index of a permutation. St000991The number of right-to-left minima of a permutation. St000286The number of connected components of the complement of a graph. St000317The cycle descent number of a permutation. St000331The number of upper interactions of a Dyck path. St000358The number of occurrences of the pattern 31-2. St000732The number of double deficiencies of a permutation. St000822The Hadwiger number of the graph. St000989The number of final rises of a permutation. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001432The order dimension of the partition. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001684The reduced word complexity of a permutation. St001727The number of invisible inversions of a permutation. St001742The difference of the maximal and the minimal degree in a graph. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St001488The number of corners of a skew partition. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000824The sum of the number of descents and the number of recoils of a permutation. St000831The number of indices that are either descents or recoils. St001537The number of cyclic crossings of a permutation. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001712The number of natural descents of a standard Young tableau. St001760The number of prefix or suffix reversals needed to sort a permutation. St001877Number of indecomposable injective modules with projective dimension 2. St000307The number of rowmotion orbits of a poset. St000632The jump number of the poset. St000272The treewidth of a graph. St000482The (zero)-forcing number of a graph. St000536The pathwidth of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000778The metric dimension of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001270The bandwidth of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001962The proper pathwidth of a graph. St000379The number of Hamiltonian cycles in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001393The induced matching number of a graph. St001580The acyclic chromatic number of a graph. St001638The book thickness of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. 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)$ . St001734The lettericity of a graph. St001624The breadth of a lattice. 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$ . St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph.