searching the database
Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000454
Mp00277: Permutations —catalanization⟶ Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000454: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000454: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => ([],1)
=> 0
[1,2] => [1,2] => [1,2] => ([],2)
=> 0
[2,1] => [2,1] => [2,1] => ([(0,1)],2)
=> 1
[1,2,3] => [1,2,3] => [1,2,3] => ([],3)
=> 0
[2,1,3] => [2,1,3] => [2,1,3] => ([(1,2)],3)
=> 1
[3,2,1] => [3,2,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 2
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ([],4)
=> 0
[1,3,4,2] => [1,3,4,2] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,4,2,3] => [1,3,4,2] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[2,1,3,4] => [2,1,3,4] => [2,1,3,4] => ([(2,3)],4)
=> 1
[2,4,1,3] => [4,3,1,2] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
[3,2,1,4] => [3,2,1,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2
[3,4,1,2] => [4,3,2,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[4,3,2,1] => [4,3,2,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> 0
[1,2,3,5,4] => [1,2,3,5,4] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,2,5,4,3] => [1,2,5,4,3] => [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,3,4,2,5] => [1,3,4,2,5] => [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,4,2,3,5] => [1,3,4,2,5] => [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => ([(3,4)],5)
=> 1
[2,3,4,5,1] => [2,3,4,5,1] => [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[2,3,5,4,1] => [2,3,5,4,1] => [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[2,4,1,3,5] => [4,3,1,2,5] => [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 2
[2,5,3,1,4] => [5,4,3,1,2] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[3,1,4,5,2] => [2,3,4,5,1] => [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[3,1,5,4,2] => [2,3,5,4,1] => [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[3,2,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> 2
[3,4,1,2,5] => [4,3,2,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[3,4,5,2,1] => [3,4,5,2,1] => [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[3,5,4,1,2] => [3,4,5,2,1] => [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[4,1,2,5,3] => [2,3,4,5,1] => [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[4,2,5,3,1] => [3,4,5,2,1] => [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[4,3,2,1,5] => [4,3,2,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[4,5,2,1,3] => [3,4,5,2,1] => [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[4,5,2,3,1] => [5,4,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[4,5,3,1,2] => [5,4,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[5,1,2,3,4] => [2,3,4,5,1] => [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[5,1,2,4,3] => [2,3,5,4,1] => [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[5,2,3,4,1] => [3,4,5,2,1] => [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[5,3,1,4,2] => [3,4,5,2,1] => [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[5,3,4,1,2] => [5,4,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[5,4,1,2,3] => [3,4,5,2,1] => [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[5,4,3,2,1] => [5,4,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,2,3,4,5,6] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => ([],6)
=> 0
[1,2,3,5,4,6] => [1,2,3,5,4,6] => [5,1,2,3,4,6] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 2
[1,2,4,5,6,3] => [1,2,4,5,6,3] => [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 3
[1,2,4,6,3,5] => [1,2,6,5,3,4] => [1,6,5,2,3,4] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
[1,2,5,3,6,4] => [1,2,4,5,6,3] => [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 3
[1,2,5,4,3,6] => [1,2,5,4,3,6] => [5,4,1,2,3,6] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
[1,2,6,3,4,5] => [1,2,4,5,6,3] => [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 3
Description
The largest eigenvalue of a graph if it is integral.
If a graph is $d$-regular, then its largest eigenvalue equals $d$. One can show that the largest eigenvalue always lies between the average degree and the maximal degree.
This statistic is undefined if the largest eigenvalue of the graph is not integral.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!