Key points are not available for this paper at this time.
A subset S of vertex set of graph G is called a 2-packing if for each pair of closed neighbourhoods of the vertices of S are pairwise disjoint. A 2-packing is called an open packing if open neighbourhoods of the vertices of S are pairwise disjoint. The open packing number, denoted by ρ0(G), is the maximum cardinality among all open packing sets of S.Here we investigate open packing number of some cycle related graphs.
P. D. Ajani (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: