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 ...

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. ...

A set S ⊆ V (G) of vertices in a graph G is called a packing of G if the closed neighborhood of the vertices of S are pairwise disjoint in G. A subset S of V (G) is called an open packing of G if the open neighborhood ...