AnnihilationNumber on LabeledGraph
The most vertices whose degrees add up to at most the number of edges.
FindStat's St001286: the largest k with the k smallest degrees adding up to at most the edges; the best set of k vertices is those. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "AnnihilationNumber"). The head's page has its examples.
Live
Distribution
Over LabeledGraphs at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St001286
The annihilation number of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
([(0,1)],2) | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001286 has the rest.