Many algorithms for approximation of restrained 2-rainbow domination in GP(n,5)

الموضوعات :

Mojtaba Ghanbari ¹

1 - Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran

تاريخ الإرسال : 22 الإثنين , شوال, 1443 تاريخ التأكيد : 02 الأربعاء , ذو القعدة, 1443 تاريخ الإصدار : 30 الأحد , رمضان, 1443

الکلمات المفتاحية: Complexity, Petersen, completeness, Domination,

ملخص المقالة :

The concept of 2-rainbow domination of a graph $G$ coincides withthe ordinary domination of the prism $G \Box K_{2}$. Ghanbari andMojdeh \cite{gm} initiated the concept of restrained 2-rainbowdomination in graphs. In this paper is given many algorithms forgood approximations of restrained 2-rainbowdomination number of generalized Petersen Graph $GP(n,5)$.