Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001574: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 0
([],2)
=> 0
([(0,1)],2)
=> 0
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> 0
([],4)
=> 0
([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 0
([(0,3),(1,2),(2,3)],4)
=> 1
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([],5)
=> 0
([(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> 2
([(1,4),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(1,4),(2,3)],5)
=> 2
([(1,4),(2,3),(3,4)],5)
=> 2
([(0,1),(2,4),(3,4)],5)
=> 2
([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
Description
The minimal number of edges to add or remove to make a graph regular.
St001576: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 0
([],2)
=> 0
([(0,1)],2)
=> 0
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> 0
([],4)
=> 0
([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 0
([(0,3),(1,2),(2,3)],4)
=> 1
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([],5)
=> 0
([(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> 2
([(1,4),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
([(1,4),(2,3)],5)
=> 2
([(1,4),(2,3),(3,4)],5)
=> 2
([(0,1),(2,4),(3,4)],5)
=> 2
([(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(3,4)],5)
=> 3
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
Description
The minimal number of edges to add or remove to make a graph vertex transitive. A graph is vertex transitive if for any two edges there is an automorphism that maps one vertex to the other.