VertexCoverNumber on LabeledGraph
The fewest vertices that meet every edge: the vertices less the independence number.
FindStat's St000362. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "VertexCoverNumber"). 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 St000362
The size of a minimal vertex cover 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/St000362 has the rest.