Processing math: 100%

Your data matches 16 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001744: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 0
[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] => 1
[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] => 0
[2,1,3,4] => 0
[2,1,4,3] => 0
[2,3,1,4] => 0
[2,3,4,1] => 0
[2,4,1,3] => 1
[2,4,3,1] => 0
[3,1,2,4] => 1
[3,1,4,2] => 0
[3,2,1,4] => 0
[3,2,4,1] => 0
[3,4,1,2] => 1
[3,4,2,1] => 0
[4,1,2,3] => 2
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 1
[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] => 0
[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] => 1
[1,3,5,4,2] => 0
[1,4,2,3,5] => 1
[1,4,2,5,3] => 0
[1,4,3,2,5] => 0
[1,4,3,5,2] => 0
[1,4,5,2,3] => 1
Description
The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. Let ν be a (partial) permutation of [k] with m letters together with dashes between some of its letters. An occurrence of ν in a permutation τ is a subsequence τa1,,τam such that ai+1=ai+1 whenever there is a dash between the i-th and the (i+1)-st letter of ν, which is order isomorphic to ν. Thus, ν is a vincular pattern, except that it is not required to be a permutation. An arrow pattern of size k consists of such a generalized vincular pattern ν and arrows b1c1,b2c2,, such that precisely the numbers 1,,k appear in the vincular pattern and the arrows. Let Φ be the map [[Mp00087]]. Let τ be a permutation and σ=Φ(τ). Then a subsequence w=(xa1,,xam) of τ is an occurrence of the arrow pattern if w is an occurrence of ν, for each arrow bc we have σ(xb)=xc and x1<x2<<xk.
Matching statistic: St000052
Mp00069: Permutations complementPermutations
Mp00061: Permutations to increasing treeBinary trees
Mp00020: Binary trees to Tamari-corresponding Dyck pathDyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [.,.]
=> [1,0]
=> 0
[1,2] => [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 0
[2,1] => [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0
[1,2,3] => [3,2,1] => [[[.,.],.],.]
=> [1,0,1,0,1,0]
=> 0
[1,3,2] => [3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 0
[2,1,3] => [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 0
[2,3,1] => [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 0
[3,1,2] => [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1
[3,2,1] => [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0
[1,2,3,4] => [4,3,2,1] => [[[[.,.],.],.],.]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,2,4,3] => [4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 0
[1,3,2,4] => [4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 0
[1,3,4,2] => [4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 0
[1,4,2,3] => [4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,4,3,2] => [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 0
[2,1,3,4] => [3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,0,0,1,0,1,0]
=> 0
[2,1,4,3] => [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[2,3,1,4] => [3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 0
[2,3,4,1] => [3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 0
[2,4,1,3] => [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,4,3,1] => [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 0
[3,1,2,4] => [2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,0,0,1,0]
=> 1
[3,1,4,2] => [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[3,2,1,4] => [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 0
[3,2,4,1] => [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[3,4,1,2] => [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,4,2,1] => [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 0
[4,1,2,3] => [1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,1,0,1,0,1,0,0]
=> 2
[4,1,3,2] => [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[4,2,1,3] => [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 1
[4,2,3,1] => [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[4,3,1,2] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,3,2,1] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,2,3,4,5] => [5,4,3,2,1] => [[[[[.,.],.],.],.],.]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,2,3,5,4] => [5,4,3,1,2] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,2,4,3,5] => [5,4,2,3,1] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0
[1,2,4,5,3] => [5,4,2,1,3] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,2,5,3,4] => [5,4,1,3,2] => [[[.,.],.],[[.,.],.]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,2,5,4,3] => [5,4,1,2,3] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0
[1,3,2,4,5] => [5,3,4,2,1] => [[[[.,.],[.,.]],.],.]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0
[1,3,2,5,4] => [5,3,4,1,2] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,3,4,2,5] => [5,3,2,4,1] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0
[1,3,4,5,2] => [5,3,2,1,4] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,3,5,2,4] => [5,3,1,4,2] => [[[.,.],.],[[.,.],.]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,3,5,4,2] => [5,3,1,2,4] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0
[1,4,2,3,5] => [5,2,4,3,1] => [[[.,.],[[.,.],.]],.]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,4,2,5,3] => [5,2,4,1,3] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,4,3,2,5] => [5,2,3,4,1] => [[[.,.],[.,[.,.]]],.]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,4,3,5,2] => [5,2,3,1,4] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,4,5,2,3] => [5,2,1,4,3] => [[[.,.],.],[[.,.],.]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
Description
The number of valleys of a Dyck path not on the x-axis. That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
Mp00237: Permutations descent views to invisible inversion bottomsPermutations
St000317: Permutations ⟶ ℤResult quality: 73% values known / values provided: 73%distinct values known / distinct values provided: 100%
Values
[1] => [1] => 0
[1,2] => [1,2] => 0
[2,1] => [2,1] => 0
[1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => 0
[2,1,3] => [2,1,3] => 0
[2,3,1] => [3,2,1] => 0
[3,1,2] => [3,1,2] => 1
[3,2,1] => [2,3,1] => 0
[1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => 0
[1,3,2,4] => [1,3,2,4] => 0
[1,3,4,2] => [1,4,3,2] => 0
[1,4,2,3] => [1,4,2,3] => 1
[1,4,3,2] => [1,3,4,2] => 0
[2,1,3,4] => [2,1,3,4] => 0
[2,1,4,3] => [2,1,4,3] => 0
[2,3,1,4] => [3,2,1,4] => 0
[2,3,4,1] => [4,2,3,1] => 0
[2,4,1,3] => [4,2,1,3] => 1
[2,4,3,1] => [3,2,4,1] => 0
[3,1,2,4] => [3,1,2,4] => 1
[3,1,4,2] => [3,4,1,2] => 0
[3,2,1,4] => [2,3,1,4] => 0
[3,2,4,1] => [4,3,2,1] => 0
[3,4,1,2] => [4,1,3,2] => 1
[3,4,2,1] => [2,4,3,1] => 0
[4,1,2,3] => [4,1,2,3] => 2
[4,1,3,2] => [4,3,1,2] => 1
[4,2,1,3] => [2,4,1,3] => 1
[4,2,3,1] => [3,4,2,1] => 1
[4,3,1,2] => [3,1,4,2] => 1
[4,3,2,1] => [2,3,4,1] => 0
[1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,3,5,4] => [1,2,3,5,4] => 0
[1,2,4,3,5] => [1,2,4,3,5] => 0
[1,2,4,5,3] => [1,2,5,4,3] => 0
[1,2,5,3,4] => [1,2,5,3,4] => 1
[1,2,5,4,3] => [1,2,4,5,3] => 0
[1,3,2,4,5] => [1,3,2,4,5] => 0
[1,3,2,5,4] => [1,3,2,5,4] => 0
[1,3,4,2,5] => [1,4,3,2,5] => 0
[1,3,4,5,2] => [1,5,3,4,2] => 0
[1,3,5,2,4] => [1,5,3,2,4] => 1
[1,3,5,4,2] => [1,4,3,5,2] => 0
[1,4,2,3,5] => [1,4,2,3,5] => 1
[1,4,2,5,3] => [1,4,5,2,3] => 0
[1,4,3,2,5] => [1,3,4,2,5] => 0
[1,4,3,5,2] => [1,5,4,3,2] => 0
[1,4,5,2,3] => [1,5,2,4,3] => 1
[1,2,3,4,5,6,7] => [1,2,3,4,5,6,7] => ? = 0
[1,2,3,4,5,7,6] => [1,2,3,4,5,7,6] => ? = 0
[1,2,3,4,6,5,7] => [1,2,3,4,6,5,7] => ? = 0
[1,2,3,4,6,7,5] => [1,2,3,4,7,6,5] => ? = 0
[1,2,3,4,7,5,6] => [1,2,3,4,7,5,6] => ? = 1
[1,2,3,4,7,6,5] => [1,2,3,4,6,7,5] => ? = 0
[1,2,3,5,4,6,7] => [1,2,3,5,4,6,7] => ? = 0
[1,2,3,5,4,7,6] => [1,2,3,5,4,7,6] => ? = 0
[1,2,3,5,6,4,7] => [1,2,3,6,5,4,7] => ? = 0
[1,2,3,5,6,7,4] => [1,2,3,7,5,6,4] => ? = 0
[1,2,3,5,7,4,6] => [1,2,3,7,5,4,6] => ? = 1
[1,2,3,5,7,6,4] => [1,2,3,6,5,7,4] => ? = 0
[1,2,3,6,4,5,7] => [1,2,3,6,4,5,7] => ? = 1
[1,2,3,6,4,7,5] => [1,2,3,6,7,4,5] => ? = 0
[1,2,3,6,5,4,7] => [1,2,3,5,6,4,7] => ? = 0
[1,2,3,6,5,7,4] => [1,2,3,7,6,5,4] => ? = 0
[1,2,3,6,7,4,5] => [1,2,3,7,4,6,5] => ? = 1
[1,2,3,6,7,5,4] => [1,2,3,5,7,6,4] => ? = 0
[1,2,3,7,4,5,6] => [1,2,3,7,4,5,6] => ? = 2
[1,2,3,7,4,6,5] => [1,2,3,7,6,4,5] => ? = 1
[1,2,3,7,5,4,6] => [1,2,3,5,7,4,6] => ? = 1
[1,2,3,7,5,6,4] => [1,2,3,6,7,5,4] => ? = 1
[1,2,3,7,6,4,5] => [1,2,3,6,4,7,5] => ? = 1
[1,2,3,7,6,5,4] => [1,2,3,5,6,7,4] => ? = 0
[1,2,4,3,5,6,7] => [1,2,4,3,5,6,7] => ? = 0
[1,2,4,3,5,7,6] => [1,2,4,3,5,7,6] => ? = 0
[1,2,4,3,6,5,7] => [1,2,4,3,6,5,7] => ? = 0
[1,2,4,3,6,7,5] => [1,2,4,3,7,6,5] => ? = 0
[1,2,4,3,7,5,6] => [1,2,4,3,7,5,6] => ? = 1
[1,2,4,3,7,6,5] => [1,2,4,3,6,7,5] => ? = 0
[1,2,4,5,3,6,7] => [1,2,5,4,3,6,7] => ? = 0
[1,2,4,5,3,7,6] => [1,2,5,4,3,7,6] => ? = 0
[1,2,4,5,6,3,7] => [1,2,6,4,5,3,7] => ? = 0
[1,2,4,5,6,7,3] => [1,2,7,4,5,6,3] => ? = 0
[1,2,4,5,7,3,6] => [1,2,7,4,5,3,6] => ? = 1
[1,2,4,5,7,6,3] => [1,2,6,4,5,7,3] => ? = 0
[1,2,4,6,3,5,7] => [1,2,6,4,3,5,7] => ? = 1
[1,2,4,6,3,7,5] => [1,2,6,4,7,3,5] => ? = 0
[1,2,4,6,5,3,7] => [1,2,5,4,6,3,7] => ? = 0
[1,2,4,6,5,7,3] => [1,2,7,4,6,5,3] => ? = 0
[1,2,4,6,7,3,5] => [1,2,7,4,3,6,5] => ? = 1
[1,2,4,6,7,5,3] => [1,2,5,4,7,6,3] => ? = 0
[1,2,4,7,3,5,6] => [1,2,7,4,3,5,6] => ? = 2
[1,2,4,7,3,6,5] => [1,2,7,4,6,3,5] => ? = 1
[1,2,4,7,5,3,6] => [1,2,5,4,7,3,6] => ? = 1
[1,2,4,7,5,6,3] => [1,2,6,4,7,5,3] => ? = 1
[1,2,4,7,6,3,5] => [1,2,6,4,3,7,5] => ? = 1
[1,2,4,7,6,5,3] => [1,2,5,4,6,7,3] => ? = 0
[1,2,5,3,4,6,7] => [1,2,5,3,4,6,7] => ? = 1
[1,2,5,3,4,7,6] => [1,2,5,3,4,7,6] => ? = 1
Description
The cycle descent number of a permutation. Let (i1,,ik) be a cycle of a permutation π such that i1 is its smallest element. A **cycle descent** of (i1,,ik) is an ia for 1a<k such that ia>ia+1. The **cycle descent set** of π is then the set of descents in all the cycles of π, and the **cycle descent number** is its cardinality.
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: 20%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[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)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 0
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 2
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],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)
=> ? = 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[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)
=> ? = 0
[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
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: 20%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[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)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 0
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 2
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],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)
=> ? = 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[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)
=> ? = 0
[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
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: 20%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[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)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 0
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 2
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],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)
=> ? = 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[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)
=> ? = 0
[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
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: 20%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[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)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 0
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 2
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],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)
=> ? = 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[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)
=> ? = 0
[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
Description
The Gutman (or modified Schultz) index of a connected graph. This is {u,v}Vd(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(T)=4W(T)(n1)(2n1) [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: 20%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[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)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 0
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[1,5,2,3,4] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 2
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],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)
=> ? = 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0
[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)
=> ? = 0
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 1
[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)
=> ? = 2
[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)
=> ? = 0
[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
Description
The hyper-Wiener index of a connected graph. This is {u,v}Vd(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: 20%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 1 = 0 + 1
[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)
=> ? = 1 + 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)
=> ? = 0 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 2 + 1
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 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)
=> ? = 0 + 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)
=> ? = 1 + 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)
=> ? = 0 + 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 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)
=> ? = 0 + 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)
=> ? = 2 + 1
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 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)
=> ? = 1 + 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 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)
=> ? = 0 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 2 + 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)
=> ? = 0 + 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
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 (4121141221411214). Its eigenvalues are 0,4,4,6, so the statistic is 2. The path on four vertices has eigenvalues 0,4.7,6,9.2 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: 20%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 1 = 0 + 1
[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)
=> ? = 1 + 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)
=> ? = 0 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 2 + 1
[4,1,3,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[4,2,1,3] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? = 1 + 1
[4,2,3,1] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 1
[4,3,1,2] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1 + 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)
=> ? = 0 + 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)
=> ? = 1 + 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)
=> ? = 0 + 1
[1,4,3,2,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,4,3,5,2] => [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 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)
=> ? = 0 + 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)
=> ? = 2 + 1
[1,5,2,4,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 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)
=> ? = 1 + 1
[1,5,3,4,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,4,2,3] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1 + 1
[1,5,4,3,2] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 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)
=> ? = 0 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 1 + 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)
=> ? = 2 + 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)
=> ? = 0 + 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
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 (4121141221411214). Its eigenvalues are 0,4,4,6, so the statistic is 1. The path on four vertices has eigenvalues 0,4.7,6,9.2 and therefore also statistic 1. The graphs with statistic n1, n2 and n3 have been characterised, see [1].
The following 6 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St001330The hat guessing number of a graph. St001862The number of crossings of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001875The number of simple modules with projective dimension at most 1.