دوره 12، شماره 1 - ( 1-1396 )
جلد 12 شماره 1 صفحات 117-107 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Sahul Hamid I, Saravanakumar S. On Open Packing Number of Graphs. IJMSI 2017; 12 (1) :107-117
URL: http://ijmsi.ir/article-1-743-fa.html
URL: http://ijmsi.ir/article-1-743-fa.html
On Open Packing Number of Graphs. مجله علوم ریاضی و انفورماتیک. 1396; 12 (1) :107-117
چکیده:
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.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
