Your data matches 45 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St000709: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,2] => 0
[2,1] => 0
[1,2,3] => 0
[1,3,2] => 0
[2,1,3] => 0
[2,3,1] => 0
[3,1,2] => 0
[3,2,1] => 0
[1,2,3,4] => 0
[1,2,4,3] => 0
[1,3,2,4] => 0
[1,3,4,2] => 0
[1,4,2,3] => 1
[1,4,3,2] => 1
[2,1,3,4] => 0
[2,1,4,3] => 0
[2,3,1,4] => 0
[2,3,4,1] => 0
[2,4,1,3] => 0
[2,4,3,1] => 0
[3,1,2,4] => 0
[3,1,4,2] => 0
[3,2,1,4] => 0
[3,2,4,1] => 0
[3,4,1,2] => 0
[3,4,2,1] => 0
[4,1,2,3] => 0
[4,1,3,2] => 0
[4,2,1,3] => 0
[4,2,3,1] => 0
[4,3,1,2] => 0
[4,3,2,1] => 0
[1,2,3,4,5] => 0
[1,2,3,5,4] => 0
[1,2,4,3,5] => 0
[1,2,4,5,3] => 0
[1,2,5,3,4] => 1
[1,2,5,4,3] => 1
[1,3,2,4,5] => 0
[1,3,2,5,4] => 0
[1,3,4,2,5] => 0
[1,3,4,5,2] => 0
[1,3,5,2,4] => 0
[1,3,5,4,2] => 0
[1,4,2,3,5] => 1
[1,4,2,5,3] => 1
[1,4,3,2,5] => 1
[1,4,3,5,2] => 1
[1,4,5,2,3] => 1
[1,4,5,3,2] => 1
Description
The number of occurrences of 14-2-3 or 14-3-2. The number of permutations avoiding both of these patterns is the case $k=2$ of the third item in Corollary 34 of [1].
Matching statistic: St000259
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000259: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 0
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 0
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
Description
The diameter of a connected graph. This is the greatest distance between any pair of vertices.
Matching statistic: St000260
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000260: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 0
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 0
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
Description
The radius of a connected graph. This is the minimum eccentricity of any vertex.
Matching statistic: St000302
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000302: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 0
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 0
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
Description
The determinant of the distance matrix of a connected graph.
Matching statistic: St000466
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000466: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 0
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 0
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
Description
The Gutman (or modified Schultz) index of a connected graph. This is $$\sum_{\{u,v\}\subseteq V} d(u)d(v)d(u,v)$$ where $d(u)$ is the degree of vertex $u$ and $d(u,v)$ is the distance between vertices $u$ and $v$. For trees on $n$ vertices, the modified Schultz index is related to the Wiener index via $S^\ast(T)=4W(T)-(n-1)(2n-1)$ [1].
Matching statistic: St000467
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000467: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 0
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 0
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 0
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 0
Description
The hyper-Wiener index of a connected graph. This is $$ \sum_{\{u,v\}\subseteq V} d(u,v)+d(u,v)^2. $$
Matching statistic: St000771
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000771: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
Description
The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $2$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore statistic $1$.
Matching statistic: St000772
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000772: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
Description
The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $1$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic $1$. The graphs with statistic $n-1$, $n-2$ and $n-3$ have been characterised, see [1].
Matching statistic: St000777
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000777: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
Description
The number of distinct eigenvalues of the distance Laplacian of a connected graph.
Matching statistic: St001645
Mp00090: Permutations cycle-as-one-line notationPermutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St001645: Graphs ⟶ ℤResult quality: 8% values known / values provided: 8%distinct values known / distinct values provided: 14%
Values
[1,2] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[2,1] => [1,2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[1,3,2] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,1,3] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[2,3,1] => [1,2,3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[3,1,2] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1] => [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,4,2,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,3,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,4] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1] => [1,2,3,4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[2,4,1,3] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1] => [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,1,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,1,4] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,2,4,1] => [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,1,2] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[3,4,2,1] => [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,1,2,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[4,3,2,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,3,2,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,3,5,2,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,3,5,4,2] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,4,2,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,2,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,2,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,4,5,3,2] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,3,2,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 3 + 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 3 + 1
[2,1,3,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,3,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,4,5,3] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,1,5,3,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,1,5,4,3] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,3,1,4,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,1,5,4] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,1,5] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,4,5,1] => [1,2,3,4,5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[2,3,5,1,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,3,5,4,1] => [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,1,5,3] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,1,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,3,5,1] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,1,3] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,4,5,3,1] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[2,5,1,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,1,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,3,1,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[2,5,3,4,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,1,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[2,5,4,3,1] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,3,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,5,6,3] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,2,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,2,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,2,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[1,3,4,5,6,2] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,4,6,5] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,4,6] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
[2,1,3,5,6,4] => [1,2,3,4,5,6] => ([],6)
=> ([],1)
=> 1 = 0 + 1
Description
The pebbling number of a connected graph.
The following 35 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001330The hat guessing number of a graph. St001964The interval resolution global dimension of a poset. St000181The number of connected components of the Hasse diagram for the poset. St001490The number of connected components of a skew partition. St001890The maximum magnitude of the Möbius function of a poset. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000068The number of minimal elements in a poset. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St000322The skewness of a graph. St000095The number of triangles of a graph. St000096The number of spanning trees of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000310The minimal degree of a vertex of a graph. St000315The number of isolated vertices of a graph. St000449The number of pairs of vertices of a graph with distance 4. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001578The minimal number of edges to add or remove to make a graph a line graph. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001871The number of triconnected components of a graph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001518The number of graphs with the same ordinary spectrum as the given graph. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset.