Many algorithms for approximation of restrained 2-rainbowdomination in GP(n, 3)

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

کلیدواژه های Many algorithms for approximation of restrained 2-rainbowdomination in GP(n, 3):

Complexity ، NP-completeness ، Domination