IndependenceNumber on LabeledGraph
The most vertices that are pairwise non-adjacent.
FindStat's St000093. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "IndependenceNumber"). 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 St000093
The cardinality of a maximal independent set of vertices of a graph.
| Object | Value |
|---|---|
([],0) | 0 |
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000093 has the rest.