GraphOpenPackingNumber on LabeledGraph
The most vertices with pairwise disjoint sets of neighbors.
FindStat's St000917. A set is an open packing when every vertex has at most one member among its neighbors. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "GraphOpenPackingNumber"). 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 St000917
The open 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/St000917 has the rest.