Power domination in splitting and degree splitting graph

Power domination in splitting and 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.

Saved in:
Bibliographic Details
Main Authors: Anitha,J., Muthukumar,S.
Format: Digital revista
Language:English
Published: Universidad Católica del Norte, Departamento de Matemáticas 2021
Online Access:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000601641
Tags: Add Tag
No Tags, Be the first to tag this record!
id oai:scielo:S0716-09172021000601641
record_format ojs
spelling oai:scielo:S0716-091720210006016412023-03-12Power domination in splitting and degree splitting graphAnitha,J.Muthukumar,S. Power dominating set Electrical power network split- ting graph 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.40 n.6 20212021-01-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000601641en10.22199/issn.0717-6279-4357-
institution SCIELO
collection OJS
country Chile
countrycode CL
component Revista
access En linea
databasecode rev-scielo-cl
tag revista
region America del Sur
libraryname SciELO
language English
format Digital
author Anitha,J.
Muthukumar,S.
spellingShingle Anitha,J.
Muthukumar,S.
Power domination in splitting and degree splitting graph
author_facet Anitha,J.
Muthukumar,S.
author_sort Anitha,J.
title Power domination in splitting and degree splitting graph
title_short Power domination in splitting and degree splitting graph
title_full Power domination in splitting and degree splitting graph
title_fullStr Power domination in splitting and degree splitting graph
title_full_unstemmed Power domination in splitting and degree splitting graph
title_sort power domination in splitting and degree splitting graph
description 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.
publisher Universidad Católica del Norte, Departamento de Matemáticas
publishDate 2021
url http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000601641
work_keys_str_mv AT anithaj powerdominationinsplittinganddegreesplittinggraph
AT muthukumars powerdominationinsplittinganddegreesplittinggraph
_version_ 1762928680769683456

Similar Items