• M. Selvaloganayaki
• P. Namasivayam

Let G = (V, E) be a simple graph. A Subset S of V is said to be strong restrained dominating set or restrained strong dominating set of G if for every u ∈ V – S, there exists elements v ∈ S and w ∈ V – S such that v and w strongly dominates u. The minimum cardinality of a strong restrained dominating set of G is called the strong restrained domination number of G and is denoted by γsrd(G). In this paper, changing and unchanging strong restrained domination number of a graphs are determined.

Domination, Strong domination, Restrained domination, Strong restrained domination

"Changing and Unchanging Strong Restrained Domination Number of a Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 9, page no.642-646, September-2018, Available :http://www.jetir.org/papers/JETIR1809603.pdf

"Changing and Unchanging Strong Restrained Domination Number of a Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 9, page no. pp642-646, September-2018, Available at : http://www.jetir.org/papers/JETIR1809603.pdf