Many algorithms for approximation of restrained ۲-rainbowdomination in GP(n, ۳)

Ghanbari and Mojdeh [۷] initiated the concept of restrained ۲-rainbow domination ingraphs. Ghanbari [۵] and [۶] approximated the Upper bounds for ۲-restrained dominationnumber of GP(n, ۲) and GP(n, ۵). In this paper is given upper bounds for ۲-restraineddomination number of an other particular case of generalized Petersen graphs

کلیدواژه ها:

Complexity ، NP-completeness ، Domination