On the Open Packing Number of a Graph
International Journal of Recent Technology and Engineering (IJRTE) · 2020
A non-empty set of a graph G is an open packing set of G if no two vertices of S have a common neighbor in G. The maximum cardinality of an open packing set is the open packing number of G and is denoted by . An open packing set of cardinality is a -set of G. In this paper, the classes of trees and unicyclic graphs for which the value of is either 2 or 3 are characterized. Moreover, the exact values of the open packing number for some special classes of graphs have been found.