DominatingSetCount on LabeledGraph
The sets of vertices such that every vertex is in the set or adjacent to one of it.
FindStat's St001303. The graph with no vertices has the empty set, so 1.
Called as CombinatorialStat(x, "DominatingSetCount"). 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 St001303
The number of dominating sets of vertices of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 1 |
([],3) | 1 |
([],4) | 1 |
([],5) | 1 |
([],6) | 1 |
([],7) | 1 |
([(0,1)],2) | 3 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001303 has the rest.