Forcing Parameters in Fully Connected Cubic Networks

Yongsheng Rao; Saeed Kosari; Janakiraman Anitha; Indra Rajasingh; Hossein Rashmanlou

doi:10.3390/math10081263

Mathematics (Apr 2022)

Forcing Parameters in Fully Connected Cubic Networks

Yongsheng Rao,
Saeed Kosari,
Janakiraman Anitha,
Indra Rajasingh,
Hossein Rashmanlou

Affiliations

Yongsheng Rao: Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
Saeed Kosari: Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
Janakiraman Anitha: Department of Mathematics, Arulmigu Kapaleeswarar Arts and Science College, Chennai 600 099, India
Indra Rajasingh: Department of Mathematics, Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences, Chennai 602 105, India
Hossein Rashmanlou: Department of Mathematics, University of Mazandarab, Babolsar 741613534, Iran

DOI: https://doi.org/10.3390/math10081263
Journal volume & issue: Vol. 10, no. 8
p. 1263

Abstract

Read online

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.

Published in Mathematics

ISSN: 2227-7390 (Online)
Publisher: MDPI AG
Country of publisher: Switzerland
LCC subjects: Science: Mathematics
Website: http://www.mdpi.com/journal/mathematics

About the journal

Abstract

Keywords