RT - Journal Article T1 - On Open Packing Number of Graphs JF - IJMSI YR - 2017 JO - IJMSI VO - 12 IS - 1 UR - http://ijmsi.ir/article-1-743-en.html SP - 107 EP - 117 K1 - Open packing K1 - Maximum degree K1 - Clique K1 - Split graphs. AB - 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. LA eng UL http://ijmsi.ir/article-1-743-en.html M3 DOI: 10.7508/ijmsi.2017.01.009 ER -