DissociationNumber on LabeledGraph
The most vertices in a set in which every vertex has at most one neighbor.
FindStat's St001315. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "DissociationNumber"). 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 St001315
The dissociation number of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
([(0,1)],2) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001315 has the rest.