Degeneracy on LabeledGraph
The greatest, over the sets of vertices, of the least number of neighbors a vertex has inside the set.
FindStat's St001277. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "Degeneracy"). 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 St001277
The degeneracy of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001277 has the rest.