%0 Journal Article
%A Sahul Hamid, I.
%A Saravanakumar, S.
%T On Open Packing Number of Graphs
%J Iranian Journal of Mathematical Sciences and Informatics
%V 12
%N 1
%U http://ijmsi.ir/article-1-743-en.html
%R DOI: 10.7508/ijmsi.2017.01.009
%D 2017
%K Open packing, Maximum degree, Clique, Split graphs.,
%X 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.
%> http://ijmsi.ir/article-1-743-en.pdf
%P 107-117
%& 107
%!
%9 Research paper
%L A-10-1467-1
%+ The Madura College(Autonomous) Madurai
%G eng
%@ 1735-4463
%[ 2017