Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001286
(load all 2 compositions to match this statistic)
Mapping
St001286: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 1
([],2)
 => 2
([(0,1)],2)
 => 1
([],3)
 => 3
([(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,2)],3)
 => 1
([],4)
 => 4
([(2,3)],4)
 => 3
([(1,3),(2,3)],4)
 => 3
([(0,3),(1,3),(2,3)],4)
 => 3
([(0,3),(1,2)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => 2
([(1,2),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([],5)
 => 5
([(3,4)],5)
 => 4
([(2,4),(3,4)],5)
 => 4
([(1,4),(2,4),(3,4)],5)
 => 4
([(0,4),(1,4),(2,4),(3,4)],5)
 => 4
([(1,4),(2,3)],5)
 => 3
([(1,4),(2,3),(3,4)],5)
 => 3
([(0,1),(2,4),(3,4)],5)
 => 3
([(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)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(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)
 => 3
([(0,1),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 3
([(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)
 => 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(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)
 => 3
([(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)
 => 3
([(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 annihilation number of a graph. For a graph on $m$ edges with degree sequence $d_1\leq\dots\leq d_n$, this is the largest number $k\leq n$ such that $\sum_{i=1}^k d_i \leq m$.