MinimumVertexCoverCount on LabeledGraph
The vertex covers with the fewest vertices: the independent sets with the most.
FindStat's St000363: the covers of the least possible size, which are the complements of the largest independent sets. The graph with no vertices has the empty cover, so 1.
Called as CombinatorialStat(x, "MinimumVertexCoverCount"). 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 St000363
The number of minimal vertex covers of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 1 |
([],3) | 1 |
([],4) | 1 |
([],5) | 1 |
([],6) | 1 |
([],7) | 1 |
([(0,1)],2) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000363 has the rest.