POWER DOMINATION MODEL AND ITS APPLICATIONS TO ELECTRICAL POWER NETWORKS
An interesting field of graph theory with a wide range of applications is the domination theory. One of the domination variants with a broad range of applications in electrical circuits is the power domination. The study of power domination in graphs greatly benefits from the placement of phase measurement units (PMUs) within the current circuit to examine the current flow. The primary goal of the study is to create a graphical model that determines the minimum number of PMUs needed to monitor the current flow in the designated areas. A theoretical model of graphs is developed, treating certain regions as graphical structures that correlate with the power domination number, and the required number of PMUs.
phase measurement units, power domination, graphs, domination, monitoring set.
Received: December 10, 2023; Accepted: February 2, 2024; Published: February 26, 2024
How to cite this article: A. Uma Maheswari and J. Bala Samuvel, Power domination model and its applications to electrical power networks, Advances and Applications in Discrete Mathematics 41(2) (2024), 179-201. http://dx.doi.org/10.17654/0974165824013
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] T. L. Baldwin, L. Mili, M. B. Boisen and R. Adapa, Power system observability with minimal phasor measurement placement, IEEE Transactions on Power Systems 8(2) (1993), 707-715. doi: 10.1109/59.260810.[2] T. W. Haynes, S. M. Hedetniemi, S. T. Hedetniemi and M. A. Henning, Domination in graphs applied to electric power networks, SIAM J. Discrete Math. 15(4) (2002), 519-529. [Online]. Available:https://doi.org/10.1137/S0895480100375831.[3] K. M. Koh and K. W. Soh, On the power domination number of the Cartesian product of graphs, AKCE Int. J. Graphs Comb. 16(3) (2019), 253-257. doi: 10.1016/j.akcej.2019.02.004.[4] S. Stephen, B. Rajan, J. Ryan, C. Grigorious and A. William, Power domination in certain chemical structures, J. Discrete Algorithms 33 (2015), 10-18. doi: 10.1016/j.jda.2014.12.003.[5] S. Prabhu, A. K. Arulmozhi and M. Arulperumjothi, On power domination in certain chemical graphs, Int. J. Pure Appl. Math. 118(11) (2018), 11-19. doi: 10.12732/ijpam.v118i11.3.[6] S. Ganesamurthy, J. Jeyaranjan and R. Srimathi, Connected power domination number of product graphs, 2022.[Online]. Available: http://arxiv.org/abs/2205.05274.[7] S. Banu Priya and A. Parthiban, Further results on equitable power domination number of graphs, Advances and Applications in Mathematical Sciences 21(8) (2022), 4427-4432.[8] B. Brimkov, R. Patel, V. Suriyanarayana and A. Teich, Power domination polynomials of graphs, 2018. [Online]. Available:http://arxiv.org/abs/1805.10984.[9] T. W. Haynes, S. Hedetniemi and P. Slater, Fundamentals of Domination in Graphs, 1st ed., CRC Press, 1998. [Online]. Available:https://doi.org/10.1201/9781482246582.