IndependentDominationNumber on LabeledGraph
The fewest vertices in a set that is independent and dominating: a maximal independent set.
FindStat's St001322. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "IndependentDominationNumber"). 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 St001322
The size of a minimal independent dominating set in 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/St001322 has the rest.