Let G=G(V,E) be a graph. A set S\subseteq V is a power dominating set of G if S observes all the vertices in V, following two rules: domination and propagation. The cardinality of a minimum power dominating set is called the power domination number. In this paper, we compute the power domination number of generalized m-Mycielskian of a cycle, C_n. We found that it depends on the numbers n \an m.


Additional Information


Sreethu, K., Varghese, Seema