GraphTwoLimitedPackingNumber on LabeledGraph
The most vertices in a set that has at most two members among the closed neighborhood of any vertex.
FindStat's St000918. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "GraphTwoLimitedPackingNumber"). 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 St000918
The 2-limited packing 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/St000918 has the rest.