Open Packing in Graphs: Bounds and Complexity

M. A. Shalu, V. K. Kirubakaran

Given a graph $G(V,E)$, a vertex subset $S$ of $G$ is called an open packing in $G$ if no pair of distinct vertices in $S$ have a common neighbour in $G$. The size of a largest ope…