RT journal article T1 Maximal double Roman domination in graphs A1 Abdollahzadeh Ahangar, H. A1 Chellali, M. A1 Sheikholeslami, S.M. A1 Valenzuela Tripodoro, Juan Carlos A2 Matemáticas K1 Roman domination K1 Double Roman domination K1 Maximal double domination AB 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 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 the maximal double Roman domination number 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 this parameter to some other domination parameters. For the class of trees, we show that for every tree T of order n≥4, 5/4 n is an upper bound for the maximal double Roman domination number and we characterize all trees attaining the bound. Finally, the exact value of this new domination parameter is given for paths and cycles. PB Elsevier Inc. SN 0096-3003 YR 2022 FD 2022-02-01 LK http://hdl.handle.net/10498/30718 UL http://hdl.handle.net/10498/30718 LA eng DS Repositorio Institucional de la Universidad de Cádiz RD 17-nov-2026