دوره 12، شماره 1 - ( 1-1396 )                   جلد 12 شماره 1 صفحات 107-117 | برگشت به فهرست نسخه ها

DOI: DOI: 10.7508/ijmsi.2017.01.009


XML Print


چکیده:  

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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى