Abstract:
A subset S of vertices of G is an open packing of G if the open neighborhoods of the vertices of S are pairwise disjoint
in G while open packing number of G is the maximum cardinality among all the open packing sets of G. We investigate open packing
number of some graphs obtained from path.
