IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i8p1263-d791578.html
   My bibliography  Save this article

Forcing Parameters in Fully Connected Cubic Networks

Author

Listed:
  • 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
    Current address: HR & CE Department, Government of Tamil Nadu, 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)

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 N P -complete. In this paper, we compute the power domination number and the zero forcing number for fully connected cubic networks.

Suggested Citation

  • Yongsheng Rao & Saeed Kosari & Janakiraman Anitha & Indra Rajasingh & Hossein Rashmanlou, 2022. "Forcing Parameters in Fully Connected Cubic Networks," Mathematics, MDPI, vol. 10(8), pages 1-11, April.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:8:p:1263-:d:791578
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/8/1263/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/8/1263/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Michael A. Henning & Jan H. van Vuuren, 2022. "Domination in graphs," Springer Optimization and Its Applications, in: Graph and Network Theory, chapter 0, pages 527-623, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Annamalai Meenakshi & Adhimoolam Kannan & Robert Cep & Muniyandy Elangovan, 2023. "Efficient Graph Network Using Total Magic Labeling and Its Applications," Mathematics, MDPI, vol. 11(19), pages 1-21, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:8:p:1263-:d:791578. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.