| تعداد نشریات | 418 |
| تعداد شمارهها | 10,013 |
| تعداد مقالات | 83,708 |
| تعداد مشاهده مقاله | 79,624,558 |
| تعداد دریافت فایل اصل مقاله | 56,298,384 |
Many algorithms for approximation of restrained 2-rainbow domination in GP(n,5) | ||
| Theory of Approximation and Applications | ||
| دوره 16، شماره 1، مرداد 2022، صفحه 93-99 اصل مقاله (551.66 K) | ||
| نوع مقاله: Research Articles | ||
| نویسنده | ||
| Mojtaba Ghanbari* | ||
| Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran | ||
| چکیده | ||
| The concept of 2-rainbow domination of a graph $G$ coincides with the ordinary domination of the prism $G \Box K_{2}$. Ghanbari and Mojdeh \cite{gm} initiated the concept of restrained 2-rainbow domination in graphs. In this paper is given many algorithms for good approximations of restrained 2-rainbow domination number of generalized Petersen Graph $GP(n,5)$. | ||
| کلیدواژهها | ||
| Petersen؛ completeness؛ complexity؛ domination | ||
|
آمار تعداد مشاهده مقاله: 36 تعداد دریافت فایل اصل مقاله: 63 |
||