- FindStat

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

Matching statistic: St001744
(load all 10 compositions to match this statistic)

Mapping

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

$\nu$ be a (partial) permutation of

$[k]$ with

$m$ letters together with dashes between some of its letters. An occurrence of

$\nu$ in a permutation

$\tau$ is a subsequence

$\tau_{a_1},\dots,\tau_{a_m}$ such that

$a_i + 1 = a_{i+1}$ whenever there is a dash between the

$i$ -th and the

$(i+1)$ -st letter of

$\nu$ , which is order isomorphic to

$\nu$ . Thus,

$\nu$ 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

$\nu$ and arrows

$b_1\to c_1, b_2\to c_2,\dots$ , such that precisely the numbers

$1,\dots,k$ appear in the vincular pattern and the arrows. Let

$\Phi$ be the map [[Mp00087]]. Let

$\tau$ be a permutation and

$\sigma = \Phi(\tau)$ . Then a subsequence

$w = (x_{a_1},\dots,x_{a_m})$ of

$\tau$ is an occurrence of the arrow pattern if

$w$ is an occurrence of

$\nu$ , for each arrow

$b\to c$ we have

$\sigma(x_b) = x_c$ and

$x_1 < x_2 < \dots < x_k$ .

Matching statistic: St000317
(load all 11 compositions to match this statistic)

Mapping

Mp00237: Permutations —descent views to invisible inversion bottoms⟶ Permutations
St000317: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●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

Description

The cycle descent number of a permutation. Let

$(i_1,\ldots,i_k)$ be a cycle of a permutation

$\pi$ such that

$i_1$ is its smallest element. A **cycle descent** of

$(i_1,\ldots,i_k)$ is an

$i_a$ for

$1 \leq a < k$ such that

$i_a > i_{a+1}$ . The **cycle descent set** of

$\pi$ is then the set of descents in all the cycles of

$\pi$ , and the **cycle descent number** is its cardinality.

Matching statistic: St000052

Mapping

Mp00069: Permutations —complement⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck 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.

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

Mapping

Mp00254: Permutations —Inverse fireworks map⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001862: Signed permutations ⟶ ℤResult quality: 9% ●values known / values provided: 9%●distinct values known / distinct values provided: 60%

Values

[1] => [1] => [1] => [1] => 0
[1,2] => [1,2] => [1,2] => [1,2] => 0
[2,1] => [2,1] => [2,1] => [2,1] => 0
[1,2,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,3,2] => [1,3,2] => 0
[2,1,3] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[2,3,1] => [1,3,2] => [1,3,2] => [1,3,2] => 0
[3,1,2] => [3,1,2] => [2,3,1] => [2,3,1] => 1
[3,2,1] => [3,2,1] => [3,2,1] => [3,2,1] => 0
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0
[1,3,2,4] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 0
[1,3,4,2] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0
[1,4,2,3] => [1,4,2,3] => [1,3,4,2] => [1,3,4,2] => 1
[1,4,3,2] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 0
[2,1,3,4] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[2,1,4,3] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0
[2,3,1,4] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 0
[2,3,4,1] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0
[2,4,1,3] => [2,4,1,3] => [3,1,4,2] => [3,1,4,2] => 1
[2,4,3,1] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 0
[3,1,2,4] => [3,1,2,4] => [2,3,1,4] => [2,3,1,4] => 1
[3,1,4,2] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0
[3,2,1,4] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 0
[3,2,4,1] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0
[3,4,1,2] => [2,4,1,3] => [3,1,4,2] => [3,1,4,2] => 1
[3,4,2,1] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 0
[4,1,2,3] => [4,1,2,3] => [2,3,4,1] => [2,3,4,1] => 2
[4,1,3,2] => [4,1,3,2] => [2,4,3,1] => [2,4,3,1] => 1
[4,2,1,3] => [4,2,1,3] => [3,2,4,1] => [3,2,4,1] => 1
[4,2,3,1] => [4,1,3,2] => [2,4,3,1] => [2,4,3,1] => 1
[4,3,1,2] => [4,3,1,2] => [3,4,2,1] => [3,4,2,1] => 1
[4,3,2,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 0
[1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,2,4,5,3] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,2,5,3,4] => [1,2,5,3,4] => [1,2,4,5,3] => [1,2,4,5,3] => 1
[1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 0
[1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,3,4,2,5] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,3,4,5,2] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,3,5,2,4] => [1,3,5,2,4] => [1,4,2,5,3] => [1,4,2,5,3] => 1
[1,3,5,4,2] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 0
[1,4,2,3,5] => [1,4,2,3,5] => [1,3,4,2,5] => [1,3,4,2,5] => 1
[1,4,2,5,3] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 0
[1,4,3,5,2] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,4,5,2,3] => [1,3,5,2,4] => [1,4,2,5,3] => [1,4,2,5,3] => 1
[2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => ? = 0
[2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => ? = 0
[2,1,4,5,3] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[2,1,5,3,4] => [2,1,5,3,4] => [2,1,4,5,3] => [2,1,4,5,3] => ? = 1
[2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 0
[2,4,1,3,5] => [2,4,1,3,5] => [3,1,4,2,5] => [3,1,4,2,5] => ? = 1
[2,5,1,3,4] => [2,5,1,3,4] => [3,1,4,5,2] => [3,1,4,5,2] => ? = 2
[2,5,1,4,3] => [2,5,1,4,3] => [3,1,5,4,2] => [3,1,5,4,2] => ? = 1
[2,5,4,1,3] => [2,5,4,1,3] => [4,1,5,3,2] => [4,1,5,3,2] => ? = 1
[3,1,2,4,5] => [3,1,2,4,5] => [2,3,1,4,5] => [2,3,1,4,5] => ? = 1
[3,1,2,5,4] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[3,1,4,2,5] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => ? = 0
[3,1,4,5,2] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[3,1,5,2,4] => [3,1,5,2,4] => [2,4,1,5,3] => [2,4,1,5,3] => ? = 1
[3,1,5,4,2] => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 0
[3,2,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => ? = 0
[3,2,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => ? = 0
[3,2,4,1,5] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => ? = 0
[3,2,4,5,1] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[3,2,5,1,4] => [3,2,5,1,4] => [4,2,1,5,3] => [4,2,1,5,3] => ? = 1
[3,2,5,4,1] => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 0
[3,4,1,2,5] => [2,4,1,3,5] => [3,1,4,2,5] => [3,1,4,2,5] => ? = 1
[3,5,1,2,4] => [3,5,1,2,4] => [3,4,1,5,2] => [3,4,1,5,2] => ? = 2
[3,5,1,4,2] => [2,5,1,4,3] => [3,1,5,4,2] => [3,1,5,4,2] => ? = 1
[3,5,2,1,4] => [3,5,2,1,4] => [4,3,1,5,2] => [4,3,1,5,2] => ? = 1
[3,5,2,4,1] => [2,5,1,4,3] => [3,1,5,4,2] => [3,1,5,4,2] => ? = 1
[3,5,4,1,2] => [2,5,4,1,3] => [4,1,5,3,2] => [4,1,5,3,2] => ? = 1
[4,1,2,3,5] => [4,1,2,3,5] => [2,3,4,1,5] => [2,3,4,1,5] => ? = 2
[4,1,2,5,3] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[4,1,3,2,5] => [4,1,3,2,5] => [2,4,3,1,5] => [2,4,3,1,5] => ? = 1
[4,1,3,5,2] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[4,1,5,2,3] => [3,1,5,2,4] => [2,4,1,5,3] => [2,4,1,5,3] => ? = 1
[4,1,5,3,2] => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 0
[4,2,1,3,5] => [4,2,1,3,5] => [3,2,4,1,5] => [3,2,4,1,5] => ? = 1
[4,2,1,5,3] => [3,2,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => ? = 0
[4,2,3,1,5] => [4,1,3,2,5] => [2,4,3,1,5] => [2,4,3,1,5] => ? = 1
[4,2,3,5,1] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[4,2,5,1,3] => [3,2,5,1,4] => [4,2,1,5,3] => [4,2,1,5,3] => ? = 1
[4,2,5,3,1] => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 0
[4,3,1,2,5] => [4,3,1,2,5] => [3,4,2,1,5] => [3,4,2,1,5] => ? = 1
[4,3,1,5,2] => [3,2,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => ? = 0
[4,3,2,1,5] => [4,3,2,1,5] => [4,3,2,1,5] => [4,3,2,1,5] => ? = 0
[4,3,2,5,1] => [3,2,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => ? = 0
[4,3,5,1,2] => [3,2,5,1,4] => [4,2,1,5,3] => [4,2,1,5,3] => ? = 1
[4,3,5,2,1] => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 0
[4,5,1,2,3] => [3,5,1,2,4] => [3,4,1,5,2] => [3,4,1,5,2] => ? = 2
[4,5,1,3,2] => [2,5,1,4,3] => [3,1,5,4,2] => [3,1,5,4,2] => ? = 1
[4,5,2,1,3] => [3,5,2,1,4] => [4,3,1,5,2] => [4,3,1,5,2] => ? = 1
[4,5,2,3,1] => [2,5,1,4,3] => [3,1,5,4,2] => [3,1,5,4,2] => ? = 1

Description

The number of crossings of a signed permutation. A crossing of a signed permutation

$\pi$ is a pair

$(i, j)$ of indices such that *

$i < j \leq \pi(i) < \pi(j)$ , or *

$-i < j \leq -\pi(i) < \pi(j)$ , or *

$i > j > \pi(i) > \pi(j)$ .

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

Mapping

Mp00254: Permutations —Inverse fireworks map⟶ Permutations
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001882: Signed permutations ⟶ ℤResult quality: 9% ●values known / values provided: 9%●distinct values known / distinct values provided: 60%

Values

[1] => [1] => [1] => [1] => 0
[1,2] => [1,2] => [1,2] => [1,2] => 0
[2,1] => [2,1] => [2,1] => [2,1] => 0
[1,2,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,3,2] => [1,3,2] => 0
[2,1,3] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[2,3,1] => [1,3,2] => [1,3,2] => [1,3,2] => 0
[3,1,2] => [3,1,2] => [2,3,1] => [2,3,1] => 1
[3,2,1] => [3,2,1] => [3,1,2] => [3,1,2] => 0
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0
[1,3,2,4] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 0
[1,3,4,2] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0
[1,4,2,3] => [1,4,2,3] => [1,3,4,2] => [1,3,4,2] => 1
[1,4,3,2] => [1,4,3,2] => [1,4,2,3] => [1,4,2,3] => 0
[2,1,3,4] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[2,1,4,3] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0
[2,3,1,4] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 0
[2,3,4,1] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0
[2,4,1,3] => [2,4,1,3] => [3,2,4,1] => [3,2,4,1] => 1
[2,4,3,1] => [1,4,3,2] => [1,4,2,3] => [1,4,2,3] => 0
[3,1,2,4] => [3,1,2,4] => [2,3,1,4] => [2,3,1,4] => 1
[3,1,4,2] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0
[3,2,1,4] => [3,2,1,4] => [3,1,2,4] => [3,1,2,4] => 0
[3,2,4,1] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0
[3,4,1,2] => [2,4,1,3] => [3,2,4,1] => [3,2,4,1] => 1
[3,4,2,1] => [1,4,3,2] => [1,4,2,3] => [1,4,2,3] => 0
[4,1,2,3] => [4,1,2,3] => [2,3,4,1] => [2,3,4,1] => 2
[4,1,3,2] => [4,1,3,2] => [3,4,2,1] => [3,4,2,1] => 1
[4,2,1,3] => [4,2,1,3] => [3,1,4,2] => [3,1,4,2] => 1
[4,2,3,1] => [4,1,3,2] => [3,4,2,1] => [3,4,2,1] => 1
[4,3,1,2] => [4,3,1,2] => [2,4,1,3] => [2,4,1,3] => 1
[4,3,2,1] => [4,3,2,1] => [4,1,2,3] => [4,1,2,3] => 0
[1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,2,4,5,3] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,2,5,3,4] => [1,2,5,3,4] => [1,2,4,5,3] => [1,2,4,5,3] => 1
[1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,3,4] => [1,2,5,3,4] => 0
[1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,3,4,2,5] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,3,4,5,2] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,3,5,2,4] => [1,3,5,2,4] => [1,4,3,5,2] => [1,4,3,5,2] => 1
[1,3,5,4,2] => [1,2,5,4,3] => [1,2,5,3,4] => [1,2,5,3,4] => 0
[1,4,2,3,5] => [1,4,2,3,5] => [1,3,4,2,5] => [1,3,4,2,5] => 1
[1,4,2,5,3] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,4,3,2,5] => [1,4,3,2,5] => [1,4,2,3,5] => [1,4,2,3,5] => 0
[1,4,3,5,2] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,4,5,2,3] => [1,3,5,2,4] => [1,4,3,5,2] => [1,4,3,5,2] => 1
[2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => ? = 0
[2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => ? = 0
[2,1,4,5,3] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[2,1,5,3,4] => [2,1,5,3,4] => [2,1,4,5,3] => [2,1,4,5,3] => ? = 1
[2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 0
[2,4,1,3,5] => [2,4,1,3,5] => [3,2,4,1,5] => [3,2,4,1,5] => ? = 1
[2,5,1,3,4] => [2,5,1,3,4] => [3,2,4,5,1] => [3,2,4,5,1] => ? = 2
[2,5,1,4,3] => [2,5,1,4,3] => [4,2,5,3,1] => [4,2,5,3,1] => ? = 1
[2,5,4,1,3] => [2,5,4,1,3] => [3,2,5,1,4] => [3,2,5,1,4] => ? = 1
[3,1,2,4,5] => [3,1,2,4,5] => [2,3,1,4,5] => [2,3,1,4,5] => ? = 1
[3,1,2,5,4] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[3,1,4,2,5] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => ? = 0
[3,1,4,5,2] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[3,1,5,2,4] => [3,1,5,2,4] => [3,4,1,5,2] => [3,4,1,5,2] => ? = 1
[3,1,5,4,2] => [2,1,5,4,3] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 0
[3,2,1,4,5] => [3,2,1,4,5] => [3,1,2,4,5] => [3,1,2,4,5] => ? = 0
[3,2,1,5,4] => [3,2,1,5,4] => [3,1,2,5,4] => [3,1,2,5,4] => ? = 0
[3,2,4,1,5] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => ? = 0
[3,2,4,5,1] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 0
[3,2,5,1,4] => [3,2,5,1,4] => [4,3,2,5,1] => [4,3,2,5,1] => ? = 1
[3,2,5,4,1] => [2,1,5,4,3] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 0
[3,4,1,2,5] => [2,4,1,3,5] => [3,2,4,1,5] => [3,2,4,1,5] => ? = 1
[3,5,1,2,4] => [3,5,1,2,4] => [2,4,3,5,1] => [2,4,3,5,1] => ? = 2
[3,5,1,4,2] => [2,5,1,4,3] => [4,2,5,3,1] => [4,2,5,3,1] => ? = 1
[3,5,2,1,4] => [3,5,2,1,4] => [4,1,3,5,2] => [4,1,3,5,2] => ? = 1
[3,5,2,4,1] => [2,5,1,4,3] => [4,2,5,3,1] => [4,2,5,3,1] => ? = 1
[3,5,4,1,2] => [2,5,4,1,3] => [3,2,5,1,4] => [3,2,5,1,4] => ? = 1
[4,1,2,3,5] => [4,1,2,3,5] => [2,3,4,1,5] => [2,3,4,1,5] => ? = 2
[4,1,2,5,3] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[4,1,3,2,5] => [4,1,3,2,5] => [3,4,2,1,5] => [3,4,2,1,5] => ? = 1
[4,1,3,5,2] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[4,1,5,2,3] => [3,1,5,2,4] => [3,4,1,5,2] => [3,4,1,5,2] => ? = 1
[4,1,5,3,2] => [2,1,5,4,3] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 0
[4,2,1,3,5] => [4,2,1,3,5] => [3,1,4,2,5] => [3,1,4,2,5] => ? = 1
[4,2,1,5,3] => [3,2,1,5,4] => [3,1,2,5,4] => [3,1,2,5,4] => ? = 0
[4,2,3,1,5] => [4,1,3,2,5] => [3,4,2,1,5] => [3,4,2,1,5] => ? = 1
[4,2,3,5,1] => [3,1,2,5,4] => [2,3,1,5,4] => [2,3,1,5,4] => ? = 1
[4,2,5,1,3] => [3,2,5,1,4] => [4,3,2,5,1] => [4,3,2,5,1] => ? = 1
[4,2,5,3,1] => [2,1,5,4,3] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 0
[4,3,1,2,5] => [4,3,1,2,5] => [2,4,1,3,5] => [2,4,1,3,5] => ? = 1
[4,3,1,5,2] => [3,2,1,5,4] => [3,1,2,5,4] => [3,1,2,5,4] => ? = 0
[4,3,2,1,5] => [4,3,2,1,5] => [4,1,2,3,5] => [4,1,2,3,5] => ? = 0
[4,3,2,5,1] => [3,2,1,5,4] => [3,1,2,5,4] => [3,1,2,5,4] => ? = 0
[4,3,5,1,2] => [3,2,5,1,4] => [4,3,2,5,1] => [4,3,2,5,1] => ? = 1
[4,3,5,2,1] => [2,1,5,4,3] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 0
[4,5,1,2,3] => [3,5,1,2,4] => [2,4,3,5,1] => [2,4,3,5,1] => ? = 2
[4,5,1,3,2] => [2,5,1,4,3] => [4,2,5,3,1] => [4,2,5,3,1] => ? = 1
[4,5,2,1,3] => [3,5,2,1,4] => [4,1,3,5,2] => [4,1,3,5,2] => ? = 1
[4,5,2,3,1] => [2,5,1,4,3] => [4,2,5,3,1] => [4,2,5,3,1] => ? = 1

Description

The number of occurrences of a type-B 231 pattern in a signed permutation. For a signed permutation

$\pi\in\mathfrak H_n$ , a triple

$-n \leq i < j < k\leq n$ is an occurrence of the type-B

$231$ pattern, if

$1 \leq j < k$ ,

$\pi(i) < \pi(j)$ and

$\pi(i)$ is one larger than

$\pi(k)$ , i.e.,

$\pi(i) = \pi(k) + 1$ if

$\pi(k) \neq -1$ and

$\pi(i) = 1$ otherwise.

Matching statistic: St000259

Mapping

Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000259: Graphs ⟶ ℤResult quality: 7% ●values known / values provided: 7%●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

Mapping

Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 7% ●values known / values provided: 7%●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

Mapping

Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000302: Graphs ⟶ ℤResult quality: 7% ●values known / values provided: 7%●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

Mapping

Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000466: Graphs ⟶ ℤResult quality: 7% ●values known / values provided: 7%●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

$\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

Mapping

Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000467: Graphs ⟶ ℤResult quality: 7% ●values known / values provided: 7%●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

$\sum_{\{u,v\}\subseteq V} d(u,v)+d(u,v)^2.$

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

St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. 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. St001875The number of simple modules with projective dimension at most 1.