MinimumDegree on LabeledGraph
The fewest edges at one vertex.
FindStat's St000310. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "MinimumDegree"). 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 St000310
The minimal degree of a vertex of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([(0,1)],2) | 1 |
([(1,2)],3) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000310 has the rest.