• Govindalakshmi T.S.
• Meena.N

Let G be a simple graph. A subset S  V(G) is called a strong (weak) perfect dominating set of G if |Ns(u) ∩ S|= 1 (|Nw(u) ∩ S| = 1) for every u ∊V(G) - S where Ns(u) = {v ∊ V(G)/ deg v ≥ deg u} (Nw(u) = {v ∊V(G)/ deg v ≤ deg u}. The minimum cardinality of a strong (weak) perfect dominating set G is called the strong (weak) perfect domination number of G and is denoted by sp(G)( wp(G)). In this paper strong perfect domination number of some sub division graphs are determined

Dominating set, perfect dominating set, strong dominating set, strong perfect dominating set, strong perfect domination number.

"Strong Perfect Domination in some Subdivision Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.710-712, February-2019, Available :http://www.jetir.org/papers/JETIRAB06135.pdf

"Strong Perfect Domination in some Subdivision Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp710-712, February-2019, Available at : http://www.jetir.org/papers/JETIRAB06135.pdf