%0 Journal Article
%T The inverse strong non-split r-domination number of a graph
%A B.K. Ameenal
%A R. Selvakumar
%J International Journal of Engineering, Science and Technology
%D 2010
%I 
%X In this paper, we define the notions of inverse strong non-split r-dominating set and inverse strong non-split r-domination number   snsr(G) of a graph G. We characterize graphs for which  snsr(G) +   snsr(G) = n, where  snsr(G) is the strong non-split r-domination number of G. We get many bounds on   snsr(G). Nordhaus-Gaddum type results are also obtained for this new parameter.
%K r-independent set
%K r-dominating set
%K strong non-split r-dominating set
%K inverse strong non-split r-dominating set
%K strong non-split r-domination number and inverse strong non-split r-domination number.
%U http://www.ijest-ng.com/ijest-ng-vol2-no1-pp127-133.pdf