GraphPackingNumber on LabeledGraph
The most vertices, no two within distance 2: the closed neighborhoods of the vertices are disjoint.
FindStat's St000916. A set is a packing when every vertex has at most one member among itself and its neighbors. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "GraphPackingNumber"). 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 St000916
The packing number of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
([(0,1)],2) | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000916 has the rest.