MaximalIndependentSetCount on LabeledGraph
The independent sets of vertices that no vertex can be added to.
FindStat's St001304. The graph with no vertices has the empty set, so 1.
Called as CombinatorialStat(x, "MaximalIndependentSetCount"). 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 St001304
The number of maximally independent 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) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001304 has the rest.