@ARTICLE{Saravanakumar, author = {Sahul Hamid, I. and Saravanakumar, S. and }, title = {On Open Packing Number of Graphs}, volume = {12}, number = {1}, abstract ={In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds. }, URL = {http://ijmsi.ir/article-1-743-en.html}, eprint = {http://ijmsi.ir/article-1-743-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, doi = {DOI: 10.7508/ijmsi.2017.01.009}, year = {2017} }