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

Maximal double Roman domination in graphs

Author

Listed:
  • Abdollahzadeh Ahangar, H.
  • Chellali, M.
  • Sheikholeslami, S.M.
  • Valenzuela-Tripodoro, J.C.

Abstract

A maximal double Roman dominating function (MDRDF) on a graph G=(V,E) is a function f:V(G)→{0,1,2,3} such that (i) every vertex v with f(v)=0 is adjacent to least two vertices assigned 2 or to at least one vertex assigned 3, (ii) every vertex v with f(v)=1 is adjacent to at least one vertex assigned 2 or 3 and (iii) the set {w∈V|f(w)=0} is not a dominating set of G. The weight of a MDRDF is the sum of its function values over all vertices, and the maximal double Roman domination number γdRm(G) is the minimum weight of an MDRDF on G. In this paper, we initiate the study of maximal double Roman domination. We first show that the problem of determining γdRm(G) is NP-complete for bipartite, chordal and planar graphs. But it is solvable in linear time for bounded clique-width graphs including trees, cographs and distance-hereditary graphs. Moreover, we establish various relationships relating γdRm(G) to some domination parameters. For the class of trees, we show that for every tree T of order n≥4,γdRm(T)≤54n and we characterize all trees attaining the bound. Finally, the exact values of γdRm(G) are given for paths and cycles.

Suggested Citation

  • Abdollahzadeh Ahangar, H. & Chellali, M. & Sheikholeslami, S.M. & Valenzuela-Tripodoro, J.C., 2022. "Maximal double Roman domination in graphs," Applied Mathematics and Computation, Elsevier, vol. 414(C).
    • Handle: RePEc:eee:apmaco:v:414:y:2022:i:c:s0096300321007463
    DOI: 10.1016/j.amc.2021.126662
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321007463
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126662?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. Abdollahzadeh Ahangar, H. & Álvarez, M.P. & Chellali, M. & Sheikholeslami, S.M. & Valenzuela-Tripodoro, J.C., 2021. "Triple Roman domination in graphs," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    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. 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. 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.
    2. 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.
    3. 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.

    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:414:y:2022:i:c:s0096300321007463. 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.