UpperDominationNumber on LabeledGraph
The most vertices in a minimal dominating set.
FindStat's St001337. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "UpperDominationNumber"). 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 St001337
The upper domination 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/St001337 has the rest.