IndependenceGap on LabeledGraph
The independence number less the fewest vertices of a maximal independent set.
FindStat's St001323; 0 when every maximal independent set is as large as can be. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "IndependenceGap"). 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 St001323
The independence gap of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001323 has the rest.