Power domination in splitting and degree splitting graph

Authors

  • Dr. J. Anitha Arulmigu Kapaleeswarar Arts and Science College.
  • Dr.S. Muthukumar Easwari Engineering College.

DOI:

https://doi.org/10.22199/issn.0717-6279-4357-4641

Keywords:

Power dominating set, Electrical power network, Degree splitting graph

Abstract

A vertex set S is called a power dominating set of a graph G if every vertex within the system is monitored by the set S following a collection of rules for power grid monitoring. The power domination number of G is the order of a minimal power dominating set of G.

In this paper, we solve the power domination number for splitting and degree splitting graph.

Author Biographies

Dr. J. Anitha, Arulmigu Kapaleeswarar Arts and Science College.

Department of Mathematics.

Dr.S. Muthukumar, Easwari Engineering College.

Department of Mathematics.

References

T. W. Haynes, S. M. Hedetniemi, S. T. Hedetniemi, and M. A. Henning, “Power domination in graphs applied to electrical power networks”, SIAM journal on discrete mathematics, vol. 15, no. 4, pp. 519-529, 2002.

G. J. Chang, P. Dorbec, M. Montassier, and A. Raspud, “Generalized power domination of graphs”, Discrete applied mathematics, vol. 160, no.12, pp. 1691-1698, 2012.

K. F. Benson, D.Ferrero, M. Flagg, V. Furst, L. Hogben, V. Vasilevskak, and B. Wissman, “Zero forcing and power domination for graph products”, 2017, arXiv: 1510.02421.

G. J. Xu, L.Y. Kang, E. F. Shan, and M. Zhao, “Power domination in block graphs”, Theoretical computer science, vol. 359, pp. 299-305, 2006.

P. Dorbec, M. Mollard, S. Klavzar, and S. Spacapan, “Power domination in product graphs”, SIAM journal on discrete mathematics, vol. 22, no. 2, pp. 554-567, 2008.

R. Barrera and D. Ferrero, “Power domination in cylinders, tori, and the generalized Petersen Graphs”, Networks, pp. 43-49, 2009.

S. Stephen, B. Rajan, J. Ryan, and C. Grigorious, “Power domination in certain chemical structures”, Journal of discrete algorithms, vol. 33, pp. 10-18, 2015.

P. Bose, C. Pennarun, and S. Verdonschot, “Power domination on tri angular grids”, 2017, arXiv:1707.02760.

F. Kazemmnejad and S. Moradi, “Total domination number of central graph”, Bulletin of the Korean Mathematical Society, vol. 56, no. 4, pp. 1059-1075, 2019.

J. Anitha, “2-Power domination number 1 for certain interconnection networks”, International journal applied engineering research, vol. 109, no. 5, pp. 59-66, 2016.

B. Basavanagoudi, P. V. Patil, and S. M. Hosamani, “Domination in degree splitting graphs”, Journal of analysis and computation, vol. 10, no. 34, pp. 27336-27341, 2015.

J. Anitha and I. Rajasingh , “Power domination parameters in hypermesh-pyramid networks and corona graphs”, International journal of pure and applied mathematics, vol. 109, no. 5, pp. 59-66, 2016.

R. Sundara Rajan ,J. Anitha, and I. Rajasingh, “2- Power domination in certain interconnection networks”, Procedia computer science, vol. 57, pp. 738-744, 2015.

M. Miller, R. S. Rajan, R. Jayagopal, I. Rajasingh, and P. Manuel, “A note on the locating-total domination in graphs”, Discussiones mathematicae graph theory, vol. 37, pp. 745-754, 2017.

Published

2021-11-29

How to Cite

[1]
J. Anitha and S. . Muthukumar, “Power domination in splitting and degree splitting graph”, Proyecciones (Antofagasta, On line), vol. 40, no. 6, pp. 1641-1655, Nov. 2021.

Issue

Section

Artículos