Power domination number of sunlet graph and other graphs

T. N. Saibavani, N. Parvathi · Journal of Discrete Mathematical Sciences and Cryptography · 2019

Placing measurement units in the vertices of an electric power system is clearly associated to determining dominate set in a graph. “A set S ⊂ V is defined power dominating set of a graph G, if every vertex and every edge in G is monitored by the set S. The minimum number of elements of a power dominating set is the power domination number ϒp(G)”. In this paper we determine the power domination number of sunlet graphs and other graphs obtained by some graph operations.

Read the paper · More papers on PaperTik