IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i1d10.1007_s10878-019-00457-3.html
   My bibliography  Save this article

Algorithmic results on double Roman domination in graphs

Author

Listed:
  • S. Banerjee

    (Indian Institute of Technology (ISM))

  • Michael A. Henning

    (University of Johannesburg)

  • D. Pradhan

    (Indian Institute of Technology (ISM))

Abstract

Given a graph $$G=(V,E)$$G=(V,E), a function $$f:V\longrightarrow \{0,1,2,3\}$$f:V⟶{0,1,2,3} is called a double Roman dominating function on G if (i) for every $$v\in V$$v∈V with $$f(v)=0$$f(v)=0, there are at least two neighbors of v that are assigned 2 under f or at least a neighbor of v that is assigned 3 under f, and (ii) for every vertex v with $$f(v)=1$$f(v)=1, there is at least one neighbor w of v with $$f(w)\ge 2$$f(w)≥2. The weight of a double Roman dominating function f is $$f(V)=\sum _{u\in V}f(u)$$f(V)=∑u∈Vf(u). The double Roman domination number of G, denoted by $$\gamma _{dR}(G)$$γdR(G) is the minimum weight of a double Roman dominating function on G. For a graph $$G=(V,E)$$G=(V,E), Min-Double-RDF is to find a double Roman dominating function f with $$f(V)=\gamma _{dR}(G)$$f(V)=γdR(G). The decision version of Min-Double-RDF is shown to be NP-complete for chordal graphs and bipartite graphs. In this paper, we first strengthen the known NP-completeness of the decision version of Min-Double-RDF by showing that the decision version of Min-Double-RDF remains NP-complete for undirected path graphs, chordal bipartite graphs, and circle graphs. We then present linear time algorithms for computing the double Roman domination number in proper interval graphs and block graphs. We then discuss on the approximability of Min-Double-RDF and present a 2-approximation algorithm in 3-regular bipartite graphs.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00457-3
    DOI: 10.1007/s10878-019-00457-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00457-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-019-00457-3?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. 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.
    2. H. Abdollahzadeh Ahangar & Michael A. Henning & Christian Löwenstein & Yancai Zhao & Vladimir Samodivkin, 2014. "Signed Roman domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 241-255, February.
    3. J. Amjadi & S. Nazari-Moghaddam & S. M. Sheikholeslami & L. Volkmann, 2018. "An upper bound on the double Roman domination number," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 81-89, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Darja Rupnik Poklukar & Janez Žerovnik, 2023. "Double Roman Domination: A Survey," Mathematics, MDPI, vol. 11(2), pages 1-20, January.
    2. Ching-Chi Lin & Cheng-Yu Hsieh & Ta-Yu Mu, 2022. "A linear-time algorithm for weighted paired-domination on block graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 269-286, August.
    3. 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.
    4. Ana Klobučar Barišić & Robert Manger, 2024. "Solving the minimum-cost double Roman domination problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(3), pages 793-817, September.
    5. Peng Li, 2024. "The k-th Roman domination problem is polynomial on interval graphs," Journal of Combinatorial Optimization, Springer, vol. 48(3), pages 1-14, October.

    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. Banerjee, S. & Henning, Michael A. & Pradhan, D., 2021. "Perfect Italian domination in cographs," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    3. Jia-Xiong Dan & Zhi-Bo Zhu & Xin-Kui Yang & Ru-Yi Li & Wei-Jie Zhao & Xiang-Jun Li, 2022. "The signed edge-domatic number of nearly cubic graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 435-445, August.
    4. 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).
    5. Hao Guan & Waheed Ahmad Khan & Amna Fida & Khadija Ali & Jana Shafi & Aysha Khan, 2024. "Dominations in Intutionistic Fuzzy Directed Graphs with Applications towards Influential Graphs," Mathematics, MDPI, vol. 12(6), pages 1-14, March.
    6. Xinyue Liu & Huiqin Jiang & Pu Wu & Zehui Shao, 2021. "Total Roman {3}-Domination: The Complexity and Linear-Time Algorithm for Trees," Mathematics, MDPI, vol. 9(3), pages 1-7, February.
    7. Hong Gao & Xing Liu & Yuanyuan Guo & Yuansheng Yang, 2022. "On Two Outer Independent Roman Domination Related Parameters in Torus Graphs," Mathematics, MDPI, vol. 10(18), pages 1-15, September.
    8. Lutz Volkmann, 2016. "Signed total Roman domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 855-871, October.
    9. 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).
    10. 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.
    11. Mahsa Darkooti & Abdollah Alhevaz & Sadegh Rahimi & Hadi Rahbani, 2019. "On perfect Roman domination number in trees: complexity and bounds," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 712-720, October.
    12. 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.
    13. Frank Werner, 2019. "Discrete Optimization: Theory, Algorithms, and Applications," Mathematics, MDPI, vol. 7(5), pages 1-4, May.
    14. 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.
    15. Guoliang Hao & Jianguo Qian, 2018. "Bounds on the domination number of a digraph," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 64-74, January.
    16. Bermudo, Sergio & Higuita, Robinson A. & Rada, Juan, 2020. "Domination in hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    17. H. Abdollahzadeh Ahangar & J. Amjadi & S. M. Sheikholeslami & L. Volkmann & Y. Zhao, 2016. "Signed Roman edge domination numbers in graphs," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 333-346, January.

    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:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00457-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.