| dc.creator | Anitha, J. | |
| dc.creator | Muthukumar, S. | |
| dc.date | 2021-11-29 | |
| dc.date.accessioned | 2022-08-30T15:59:38Z | |
| dc.date.available | 2022-08-30T15:59:38Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4641 | |
| dc.identifier | 10.22199/issn.0717-6279-4357-4641 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/207087 | |
| dc.description | 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. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4641/3945 | |
| dc.rights | Copyright (c) 2021 Dr. J. Anitha, Dr.S. Muthukumar | en-US |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 40 No. 6 (2021); 1641-1655 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 40 Núm. 6 (2021); 1641-1655 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2021-06 | |
| dc.subject | Power dominating set | en-US |
| dc.subject | Electrical power network | en-US |
| dc.subject | Degree splitting graph | en-US |
| dc.subject | Graph Theory | en-US |
| dc.title | Power domination in splitting and degree splitting graph | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
