The packing number of cubic graphs

Abstract

A packing in a graph is a set of vertices that are mutually distance at least 3 apart. By using optimization and linear programming to help analyze the greedy algorithm, we improve on a result of Favaron and show that every connected cubic graph of order $n$ has a packing of size at least $\frac{17}{132}n-O\left(1\right)$.