searching the database
Your data matches 384 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: St000171
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
Description
The degree of the graph.
This is the maximal vertex degree of a graph.
Matching statistic: St000312
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
Description
The number of leaves in a graph.
That is, the number of vertices of a graph that have degree 1.
Matching statistic: St001112
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
Description
The 3-weak dynamic number of a graph.
A k-weak-dynamic coloring of a graph G is a (non-proper) coloring of G in such a way that each vertex v sees at least min colors in its neighborhood. The k-weak-dynamic number of a graph is the smallest number of colors needed to find an k-dynamic coloring.
This statistic records the 3-weak-dynamic number of a graph.
Matching statistic: St001118
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
Description
The acyclic chromatic index of a graph.
An acyclic edge coloring of a graph is a proper colouring of the edges of a graph such that the union of the edges colored with any two given colours is a forest.
The smallest number of colours such that such a colouring exists is the acyclic chromatic index.
Matching statistic: St001883
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 2
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 2
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 3
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 2
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
Description
The mutual visibility number of a graph.
This is the largest cardinality of a subset P of vertices of a graph G, such that for each pair of vertices in P there is a shortest path in G which contains no other point in P.
In particular, the mutual visibility number of the disjoint union of two graphs is the maximum of their mutual visibility numbers.
Matching statistic: St000537
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 2 = 3 - 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 2 = 3 - 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
Description
The cutwidth of a graph.
This is the minimum possible width of a linear ordering of its vertices, where the width of an ordering \sigma is the maximum, among all the prefixes of \sigma, of the number of edges that have exactly one vertex in a prefix.
Matching statistic: St001110
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4 = 3 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
Description
The 3-dynamic chromatic number of a graph.
A k-dynamic coloring of a graph G is a proper coloring of G in such a way that each vertex v sees at least \min\{d(v), k\} colors in its neighborhood. The k-dynamic chromatic number of a graph is the smallest number of colors needed to find an k-dynamic coloring.
This statistic records the 3-dynamic chromatic number of a graph.
Matching statistic: St001270
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 2 = 3 - 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 2 = 3 - 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
Description
The bandwidth of a graph.
The bandwidth of a graph is the smallest number k such that the vertices of the graph can be
ordered as v_1,\dots,v_n with k \cdot d(v_i,v_j) \geq |i-j|.
We adopt the convention that the singleton graph has bandwidth 0, consistent with the bandwith of the complete graph on n vertices having bandwidth n-1, but in contrast to any path graph on more than one vertex having bandwidth 1. The bandwidth of a disconnected graph is the maximum of the bandwidths of the connected components.
Matching statistic: St001644
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 2 - 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 2 = 3 - 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 2 = 3 - 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 2 - 1
Description
The dimension of a graph.
The dimension of a graph is the least integer n such that there exists a representation of the graph in the Euclidean space of dimension n with all vertices distinct and all edges having unit length. Edges are allowed to intersect, however.
Matching statistic: St001674
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> 3 = 2 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 4 = 3 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,3),(3,6),(4,6),(5,6)],7)
=> 4 = 3 + 1
([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 3 = 2 + 1
Description
The number of vertices of the largest induced star graph in the graph.
The following 374 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001962The proper pathwidth of a graph. St001307The number of induced stars on four vertices in a graph. St001638The book thickness of a graph. St000271The chromatic index of a graph. St001578The minimal number of edges to add or remove to make a graph a line graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001191Number of simple modules S with Ext_A^i(S,A)=0 for all i=0,1,...,g-1 in the corresponding Nakayama algebra A with global dimension g. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001256Number of simple reflexive modules that are 2-stable reflexive. St001481The minimal height of a peak of a Dyck path. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001193The dimension of Ext_A^1(A/AeA,A) in the corresponding Nakayama algebra A such that eA is a minimal faithful projective-injective module. 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. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St001696The natural major index of a standard Young tableau. 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. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St000286The number of connected components of the complement of a graph. St000096The number of spanning trees of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by 4. St000310The minimal degree of a vertex of a graph. St000322The skewness of a graph. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001890The maximum magnitude of the Möbius function of a poset. St001060The distinguishing index of a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St000916The packing number of a graph. 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. St001740The number of graphs with the same symmetric edge polytope as the given graph. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St001367The smallest number which does not occur as degree of a vertex in a graph. St000479The Ramsey number of a graph. St000287The number of connected components of a graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St000315The number of isolated vertices of a graph. St000264The girth of a graph, which is not a tree. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001568The smallest positive integer that does not appear twice in the partition. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001651The Frankl number of a lattice. St000687The dimension of Hom(I,P) for the LNakayama algebra of a Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001330The hat guessing number of a graph. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001196The global dimension of A minus the global dimension of eAe for the corresponding Nakayama algebra with minimal faithful projective-injective module eA. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001471The magnitude of a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001732The number of peaks visible from the left. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001309The number of four-cliques in a graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001198The number of simple modules in the algebra eAe with projective dimension at most 1 in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001206The maximal dimension of an indecomposable projective eAe-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module eA. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001188The number of simple modules S with grade \inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \} at least two in the Nakayama algebra A corresponding to the Dyck path. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000258The burning number of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000918The 2-limited packing number of a graph. St001093The detour number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000273The domination number of a graph. St000349The number of different adjacency matrices of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000535The rank-width of a graph. St000544The cop number of a graph. St000553The number of blocks of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001057The Grundy value of the game of creating an independent set in a graph. St001271The competition number of a graph. St001272The number of graphs with the same degree sequence. St001282The number of graphs with the same chromatic polynomial. St001322The size of a minimal independent dominating set in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001352The number of internal nodes in the modular decomposition of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001363The Euler characteristic of a graph according to Knill. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001393The induced matching number of a graph. St001463The number of distinct columns in the nullspace of a graph. St001512The minimum rank of a graph. St001642The Prague dimension of a graph. St001734The lettericity of a graph. St001739The number of graphs with the same edge polytope as the given graph. St001765The number of connected components of the friends and strangers graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001829The common independence number of a graph. St001917The order of toric promotion on the set of labellings of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000403The Szeged index minus the Wiener index of a graph. St000448The number of pairs of vertices of a graph with distance 2. St000552The number of cut vertices of a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in a graph. St001308The number of induced paths on three vertices in a graph. St001310The number of induced diamond graphs in a graph. St001323The independence gap of 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. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001374The Padmakar-Ivan index of a graph. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001689The number of celebrities in a graph. St001691The number of kings in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001703The villainy of a graph. St001708The number of pairs of vertices of different degree in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001764The number of non-convex subsets of vertices in a graph. St001793The difference between the clique number and the chromatic number 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. St001799The number of proper separations of a graph. St000455The second largest eigenvalue of a graph if it is integral. St000542The number of left-to-right-minima of a permutation. St000955Number of times one has Ext^i(D(A),A)>0 for i>0 for the corresponding LNakayama algebra. St000990The first ascent of a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001530The depth of a Dyck path. St001741The largest integer such that all patterns of this size are contained in the permutation. St000056The decomposition (or block) number of a permutation. St000078The number of alternating sign matrices whose left key is the permutation. St000255The number of reduced Kogan faces with the permutation as type. St000314The number of left-to-right-maxima of a permutation. St000487The length of the shortest cycle of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000570The Edelman-Greene number of a permutation. St000654The first descent of a permutation. St000756The sum of the positions of the left to right maxima of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000873The aix statistic of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c_0,c_1,...,c_{n−1}] by adding c_0 to c_{n−1}. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001162The minimum jump of a permutation. 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). St001192The maximal dimension of Ext_A^2(S,A) for a simple module S over the corresponding Nakayama algebra A. St001201The grade of the simple module S_0 in the special CNakayama algebra corresponding to the Dyck path. St001202Call 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. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001344The neighbouring number of a permutation. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001665The number of pure excedances of a permutation. St001737The number of descents of type 2 in a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000210Minimum over maximum difference of elements in cycles. St000217The number of occurrences of the pattern 312 in a permutation. St000221The number of strong fixed points of a permutation. St000234The number of global ascents of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000317The cycle descent number of a permutation. St000338The number of pixed points of a permutation. St000358The number of occurrences of the pattern 31-2. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length 3. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000461The rix statistic of a permutation. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000516The number of stretching pairs of a permutation. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000649The number of 3-excedences of a permutation. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. St000674The number of hills of a Dyck path. St000709The number of occurrences of 14-2-3 or 14-3-2. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000962The 3-shifted major index of a permutation. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001139The number of occurrences of hills of size 2 in a Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001141The number of occurrences of hills of size 3 in a Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001381The fertility of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. 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. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001847The number of occurrences of the pattern 1432 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001205The number of non-simple indecomposable projective-injective modules of the algebra eAe in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. 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. St001722The number of minimal chains with small intervals between a binary word and the top element. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St000069The number of maximal elements of a poset. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001820The size of the image of the pop stack sorting operator. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St000735The last entry on the main diagonal of a standard tableau. St000477The weight of a partition according to Alladi. St000478Another weight of a partition according to Alladi. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000661The number of rises of length 3 of a Dyck path. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000929The constant term of the character polynomial of an integer partition. St000931The number of occurrences of the pattern UUU in a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001618The cardinality of the Frattini sublattice of a lattice. St001720The minimal length of a chain of small intervals in a lattice. 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. St001881The number of factors of a lattice as a Cartesian product of lattices. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001616The number of neutral elements in a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001833The number of linear intervals in a lattice. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001620The number of sublattices of a lattice. St001679The number of subsets of a lattice whose meet is the bottom element. St001625The Möbius invariant of a lattice. 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. St001335The cardinality of a minimal cycle-isolating set of a graph. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St000618The number of self-evacuating tableaux of given shape. St000068The number of minimal elements in a poset. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000486The number of cycles of length at least 3 of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000711The number of big exceedences of a permutation. St001081The number of minimal length factorizations of a permutation into star transpositions. St001194The injective dimension of A/AfA in the corresponding Nakayama algebra A when Af is the minimal faithful projective-injective left A-module 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. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. 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. St000256The number of parts from which one can substract 2 and still get an integer partition. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000663The number of right floats of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001811The Castelnuovo-Mumford regularity of a permutation. St001836The number of occurrences of a 213 pattern in the restricted growth word of a perfect matching. 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. St001960The number of descents of a permutation minus one if its first entry is not one. St000327The number of cover relations in a poset. St000181The number of connected components of the Hasse diagram for the poset. St001637The number of (upper) dissectors 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!