Forcing Parameters in Fully Connected Cubic Networks

Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem. Another variant is the zero forcing problem. Determining minimum cardinality of a power dominatin...

Full description

Saved in:
Bibliographic Details
Published inMathematics (Basel) Vol. 10; no. 8; p. 1263
Main Authors Rao, Yongsheng, Kosari, Saeed, Anitha, Janakiraman, Rajasingh, Indra, Rashmanlou, Hossein
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.04.2022
Subjects
dominating set
Electric power systems
electrical power network
fully connected cubic networks
Graphs
power dominating set
zero forcing set
Online AccessGet full text

Cover

More Information
Summary:Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem. Another variant is the zero forcing problem. Determining minimum cardinality of a power dominating set and zero forcing set in a graph are the power domination problem and zero forcing problem, respectively. Both problems are NP-complete. In this paper, we compute the power domination number and the zero forcing number for fully connected cubic networks.
ISSN:2227-7390
2227-7390
DOI:10.3390/math10081263