IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v438y2023ics0096300322006282.html
   My bibliography  Save this article

Restrained condition on double Roman dominating functions

Author

Listed:
  • Samadi, B.
  • Soltankhah, N.
  • Abdollahzadeh Ahangar, H.
  • Chellali, M.
  • Mojdeh, D.A.
  • Sheikholeslami, S.M.
  • Valenzuela-Tripodoro, J.C.

Abstract

We continue the study of restrained double Roman domination in graphs. For a graph G=(V(G),E(G)), a double Roman dominating function f is called a restrained double Roman dominating function (RDRD function) if the subgraph induced by {v∈V(G)∣f(v)=0} has no isolated vertices. The restrained double Roman domination number (RDRD number) γrdR(G) is the minimum weight ∑v∈V(G)f(v) taken over all RDRD functions of G.

Suggested Citation

  • Samadi, B. & Soltankhah, N. & Abdollahzadeh Ahangar, H. & Chellali, M. & Mojdeh, D.A. & Sheikholeslami, S.M. & Valenzuela-Tripodoro, J.C., 2023. "Restrained condition on double Roman dominating functions," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    • Handle: RePEc:eee:apmaco:v:438:y:2023:i:c:s0096300322006282
    DOI: 10.1016/j.amc.2022.127554
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322006282
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127554?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Huiqin Jiang & Pu Wu & Zehui Shao & Yongsheng Rao & Jia-Bao Liu, 2018. "The Double Roman Domination Numbers of Generalized Petersen Graphs P ( n , 2)," Mathematics, MDPI, vol. 6(10), pages 1-11, October.
    2. Yue, Jun & Wei, Meiqin & Li, Min & Liu, Guodong, 2018. "On the double Roman domination of graphs," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 669-675.
    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. Darja Rupnik Poklukar & Janez Žerovnik, 2023. "Double Roman Domination: A Survey," Mathematics, MDPI, vol. 11(2), pages 1-20, January.
    2. Liu, Xiaoxiao & Sun, Shiwen & Wang, Jiawei & Xia, Chengyi, 2019. "Onion structure optimizes attack robustness of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    3. Banerjee, S. & Henning, Michael A. & Pradhan, D., 2021. "Perfect Italian domination in cographs," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    4. S. Banerjee & Michael A. Henning & D. Pradhan, 2020. "Algorithmic results on double Roman domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 90-114, January.
    5. Zehui Shao & Rija Erveš & Huiqin Jiang & Aljoša Peperko & Pu Wu & Janez Žerovnik, 2021. "Double Roman Graphs in P (3 k , k )," Mathematics, MDPI, vol. 9(4), pages 1-18, February.
    6. Enrico Enriquez & Grace Estrada & Carmelita Loquias & Reuella J Bacalso & Lanndon Ocampo, 2021. "Domination in Fuzzy Directed Graphs," Mathematics, MDPI, vol. 9(17), pages 1-14, September.
    7. Frank Werner, 2019. "Discrete Optimization: Theory, Algorithms, and Applications," Mathematics, MDPI, vol. 7(5), pages 1-4, May.
    8. Ma, Yuede & Cai, Qingqiong & Yao, Shunyu, 2019. "Integer linear programming models for the weighted total domination problem," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 146-150.
    9. Bermudo, Sergio & Higuita, Robinson A. & Rada, Juan, 2020. "Domination in hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 369(C).

    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:eee:apmaco:v:438:y:2023:i:c:s0096300322006282. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.