searching the database
Your data matches 206 different statistics 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: St000368
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
Description
The Altshuler-Steinberg determinant of a graph.
This is defined as the determinant of $MM^t$ where $M$ is the incidence matrix of $G$.
Matching statistic: St000948
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
Description
The chromatic discriminant of a graph.
The chromatic discriminant $\alpha(G)$ is the coefficient of the linear term of the chromatic polynomial $\chi(G,q)$.
According to [1], it equals the cardinality of any of the following sets:
(1) Acyclic orientations of G with unique sink at $q$,
(2) Maximum $G$-parking functions relative to $q$,
(3) Minimal $q$-critical states,
(4) Spanning trees of G without broken circuits,
(5) Conjugacy classes of Coxeter elements in the Coxeter group associated to $G$,
(6) Multilinear Lyndon heaps on $G$.
In addition, $\alpha(G)$ is also equal to the the dimension of the root space corresponding to the sum of all simple roots in the Kac-Moody Lie algebra associated to the graph.
Matching statistic: St001119
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
Description
The length of a shortest maximal path in a graph.
Matching statistic: St001373
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5 = 4 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5 = 4 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 5 = 4 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
Description
The logarithm of the number of winning configurations of the lights out game on a graph.
In the single player lamps out game, every vertex has two states, on or off. The player can toggle the state of a vertex, in which case all the neighbours of the vertex change state, too. The goal is to reach the configuration with all vertices off.
Matching statistic: St000261
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
Description
The edge connectivity of a graph.
This is the minimum number of edges that has to be removed to make the graph disconnected.
Matching statistic: St000262
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
Description
The vertex connectivity of a graph.
For non-complete graphs, this is the minimum number of vertices that has to be removed to make the graph disconnected.
Matching statistic: St000310
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
Description
The minimal degree of a vertex of a graph.
Matching statistic: St000351
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> ([],3)
=> 0
Description
The determinant of the adjacency matrix of a graph.
For a labelled graph $G$ with vertices $\{1,\ldots,n\}$, the adjacency matrix is the matrix $(a_{ij})$ with $a_{ij} = 1$ if the vertices $i$ and $j$ are joined by an edge in $G$.
Since the determinant is invariant under simultaneous row and column permutations, the determinant of the adjacency is well-defined for an unlabelled graph.
According to [2], Equation 8, this determinant can be computed as follows: let $s(G)$ be the number of connected components of $G$ that are cycles and $r(G)$ the number of connected components that equal $K_2$. Then $$\det(A) = \sum_{H} (-1)^{r(H)} 2^{s(H)}$$ where the sum is over all spanning subgraphs $H$ of $G$ that have as connected components only $K_2$'s and cycles.
Matching statistic: St000915
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],4)
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],5)
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([],3)
=> 0
Description
The Ore degree of a graph.
This is the maximal Ore degree of an edge, which is the sum of the degrees of its two endpoints.
Matching statistic: St000944
Mp00154: Graphs —core⟶ Graphs
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000944: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000944: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,1,1,1]
=> 0
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => [2,2,1]
=> 4
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,1,1,1]
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,1,1,1]
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,1,1,1]
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,1,1,1]
=> 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,1,1,1,1]
=> 0
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => [2,2,1]
=> 4
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => [2,2,1]
=> 4
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1]
=> 0
Description
The 3-degree of an integer partition.
For an integer partition $\lambda$, this is given by the exponent of 3 in the Gram determinant of the integal Specht module of the symmetric group indexed by $\lambda$.
This stupid comment should not be accepted as an edit!
The following 196 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001120The length of a longest path in a graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001869The maximum cut size of a graph. St000069The number of maximal elements of a poset. St000267The number of maximal spanning forests contained in a graph. St000286The number of connected components of the complement of a graph. St000363The number of minimal vertex covers of a graph. St000667The greatest common divisor of the parts of the partition. St000722The number of different neighbourhoods in a graph. St000908The length of the shortest maximal antichain in a poset. St001029The size of the core of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001546The number of monomials in the Tutte polynomial of a graph. St001694The number of maximal dissociation sets in a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001725The harmonious chromatic number of a graph. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St001091The number of parts in an integer partition whose next smaller part has the same size. St000160The multiplicity of the smallest part of a partition. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000993The multiplicity of the largest part of an integer partition. St000143The largest repeated part of a partition. St000181The number of connected components of the Hasse diagram for the poset. St000668The least common multiple of the parts of the partition. St000770The major index of an integer partition when read from bottom to top. St001571The Cartan determinant of the integer partition. St001645The pebbling number of a connected graph. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001703The villainy of a graph. St000455The second largest eigenvalue of a graph if it is integral. St000379The number of Hamiltonian cycles in a graph. St000422The energy of a graph, if it is integral. St000699The toughness times the least common multiple of 1,. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000741The Colin de Verdière graph invariant. St001271The competition number of a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St000644The number of graphs with given frequency partition. St001613The binary logarithm of the size of the center of a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001621The number of atoms of a lattice. St001622The number of join-irreducible elements of a lattice. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St000088The row sums of the character table of the symmetric group. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001616The number of neutral elements in a lattice. St001618The cardinality of the Frattini sublattice of a lattice. St001624The breadth of a lattice. St001625The Möbius invariant of a lattice. St001679The number of subsets of a lattice whose meet is the bottom element. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St001754The number of tolerances of a finite lattice. St001820The size of the image of the pop stack sorting operator. St001833The number of linear intervals in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001330The hat guessing number of a graph. St001619The number of non-isomorphic sublattices of a lattice. St001620The number of sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001545The second Elser number of a connected graph. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001651The Frankl number of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St000479The Ramsey number of a graph. St001256Number of simple reflexive modules that are 2-stable reflexive. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001175The size of a partition minus the hook length of the base cell. St001248Sum of the even parts of a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St000618The number of self-evacuating tableaux of given shape. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000264The girth of a graph, which is not a tree. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St000464The Schultz index of a connected graph. St000260The radius of a connected graph. St000475The number of parts equal to 1 in a partition. St000929The constant term of the character polynomial of an integer partition. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St000068The number of minimal elements in a poset. St001570The minimal number of edges to add to make a graph Hamiltonian. St001060The distinguishing index of a graph. St000454The largest eigenvalue of a graph if it is integral. St001568The smallest positive integer that does not appear twice in the partition. St001890The maximum magnitude of the Möbius function of a poset. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000623The number of occurrences of the pattern 52341 in a permutation. St000666The number of right tethers of a permutation. St000787The number of flips required to make a perfect matching noncrossing. St000879The number of long braid edges in the graph of braid moves of a permutation. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001381The fertility of a permutation. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001549The number of restricted non-inversions between exceedances. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001811The Castelnuovo-Mumford regularity of a permutation. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001850The number of Hecke atoms of a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000056The decomposition (or block) number of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000788The number of nesting-similar perfect matchings of a perfect matching. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001081The number of minimal length factorizations of a permutation into star transpositions. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001461The number of topologically connected components of the chord diagram of a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001590The crossing number of a perfect matching. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000259The diameter of a connected graph. St001305The number of induced cycles on four vertices in a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001479The number of bridges of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001322The size of a minimal independent dominating set in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001363The Euler characteristic of a graph according to Knill. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001301The first Betti number of the order complex associated with the poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset.
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!