References
- Anitha J., Graphs with Power Domination number One or Two, International Conference on Mathematical Computer Engineering - IC- MCE – 2013, pp. 1272-1275.
- Chang G. J., Dorbec P., Montassier M., and A. Raspaud, Generalized power domination of graphs, Discrete Appl. Math., 160, pp. 1691–1698, (2012), doi: 10.1016/j.dam.2012.03.007
- Chaluvaraju B. and Soner N. D., Complementary total domination in graphs, Journal of discrete mathematical sciences and cryptography, 10 10.4, pp. 505-516, (2007). doi: 10.1080/09720529.2007.10698135
- Dean N., Ilic A., Ramirez I., and Shen J., Tian K., On the Power dominating Sets of Hypercubes, IEEE 14th International Conference On Computational Science and Engineering, (2011).
- Dorfling M., Henning M. A., A note on power domination in grid graphs, Discrete Appl. Math., 154 pp. 1023-1027, (2006). doi: 10.1016/j.dam.2005.08.006
- Guo J., Niedermeier R., and Raible D., Improved algorithms and complexity results for power domination in graphs, Lecture Notes in Comput. Sci., 3623, pp. 172–184, Springer, Berlin, (2005). doi: 10.1007/11537311_16
- Haynes T.W., Hedetniemi S.M., Hedetniemi S.T., Henning M.A., Power domination in graphs applied to electrical power networks, SIAM J. Discrete Math., 15.4, pp. 519-529, (2002). doi: 10.1137/S0895480100375831
- Haynes T.W., Hedetniemi S.T., Slater P.J. (Eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, (1998).
- Hong Yang and Xiujun Zhang, The independent domination numbers of strong product of two cycles, Journal of discrete mathematical sciences and cryptography, 21(7-8), pp. 1495-1507, (2018). doi: 10.1080/09720529.2017.1316988
- Kung–JuiPai, Jou–Ming Chang and Yue–Li Wang, A Simple Algorithm for Solving the Power Domination Problem on Grid Graphs, The 24th Workshop on Combinatorial Mathematics and Computation Theory.
- Liao C.-S. and Lee D.T., Power domination problem in graphs, Lecture Notes in Comput.Sci. 3595, Springer, Berlin, pp. 818–828, (2005). doi: 10.1007/11533719_83
- Shobana A. and Logapriya B., Domination number of N-Sunlet graph, International Journal of Pure and Applied Mathematics, 118.2, pp. 1149-1152, (2018).
- Varghese S. and Vijayakumar A., Power domination in some classes of graphs, EuroComb’11, (2011).
- Vimala Rani A. and Parvathi N., Upper bound for the Radio Number of Some Families of Sunlet Graph, Indian journal of Science and Technology, 9.46, (2016). doi: 10.17485/ijst/2016/v9i46/98606
- Zhao M., Kang L., and Chang G., Power domination in graphs. Discrete Mathematics, 306.15, pp. 1812–1816, (2006). doi: 10.1016/j.disc.2006.03.037