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

محورهای موضوعی : Applied Mathematics Modeling

Mojtaba Ghanbari ¹ (Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran)

تاریخ دریافت : 1401/03/02 تاریخ پذیرش : 1401/03/11 تاریخ انتشار : 1401/02/11

کلید واژه: 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)$.