Forcing Parameters in Fully Connected Cubic Networks

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

doi:10.3390/math10081263

journal article Open Access Apr 11, 2022

Forcing Parameters in Fully Connected Cubic Networks

Yongsheng Rao

Saeed Kosari

Janakiraman Anitha Indra Rajasingh Hossein Rashmanlou

Mathematics Vol. 10 No. 8 pp. 1263 · MDPI AG

View at Publisher Save 10.3390/math10081263

Abstract

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.

Topics

No keywords indexed for this article. Browse by subject →

References

15

[1]

Haynes "Power domination in graphs applied to electrical power networks" SIAM J. Discret. Math. (2002) 10.1137/s0895480100375831

[2]

Chang "Generalized power domination of graphs" Discret. Appl. Math. (2012) 10.1016/j.dam.2012.03.007

[3]

Benson, K.F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevskak, V., and Wissman, B. (2017). Zero forcing and power domination for graph products. arXiv.

[4]

Dorfling "A note on Power domination problem in graphs" Discret. Appl. Math. (2006) 10.1016/j.dam.2005.08.006

[5]

Liao "Power domination problems in graphs" Comput. Comb. Lect. Notes Comput. Sci. (2005)

[6]

Barrera "Power domination in cylinders, tori, and the generalized Petersen Graphs" Networks (2009) 10.1002/net.20413

[7]

Cockayne "Towards a theory of domination in graphs" Networks (1977) 10.1002/net.3230070305

[8]

Chen "A general broadcasting scheme for recursive networks with complete connection" Parallel Comput. (2001) 10.1016/s0167-8191(01)00088-6

[9]

Dorbec "Power domination in product graphs" SIAM J. Discret. Math. (2008) 10.1137/060661879

[10]

Ho "Fault-tolerant hamiltonian connectivity and fault-tolerant hamiltonianicity of the fully connected cubic networks" J. Inf. Sci. Eng. (2009)

[11]

Kosari "Double roman domination graphs with minimum degree at least two and no C5-cycle" Graphs Comb. (2022) 10.1007/s00373-021-02434-2

[12]

Kosari "On a conjucture concerning total domination subdivision number in graphs" AKCE Int. J. Graphs Comb. (2021) 10.1080/09728600.2021.1985386

[13]

Xu "Power domination in block graphs" Theor. Comput. Sci. (2006) 10.1016/j.tcs.2006.04.011

[14]

Zhao "Power domination in graphs" Discret. Math. (2006) 10.1016/j.disc.2006.03.037

[15]

Yanga "An oblivious shortest-path routing algorithm for fully connected cubic networks" J. Parallel Distrib. Comput. (2006) 10.1016/j.jpdc.2006.03.008

Metrics

11

Citations

15

References

Details

Published: Apr 11, 2022
Vol/Issue: 10(8)
Pages: 1263
License: View

Authors

Y

Yongsheng Rao

Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China

S

Saeed Kosari

Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China

J

Janakiraman Anitha

Department of Mathematics, Arulmigu Kapaleeswarar Arts and Science College, Chennai 600 099, India

I

Indra Rajasingh

Department of Mathematics, Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences, Chennai 602 105, India

H

Hossein Rashmanlou

Department of Mathematics, University of Mazandarab, Babolsar 741613534, Iran

Funding

the National Natural Science Foundation of China Award: 62172116

the National Key R & D Program of China Award: 2018YFB1005100

Guangzhou Academician and Expert Workstation Award: 20200115-9

Cite This Article

Yongsheng Rao, Saeed Kosari, Janakiraman Anitha, et al. (2022). Forcing Parameters in Fully Connected Cubic Networks. Mathematics, 10(8), 1263. https://doi.org/10.3390/math10081263

Forcing Parameters in Fully Connected Cubic Networks

You May Also Like