RT journal article T1 On the Outer Independent Total Double Roman Domination in Graphs A1 Abdollahzadeh Ahangar, H. A1 Chellali, Mustapha A1 Sheikholeslami, Seyed Mahmoud A1 Valenzuela Tripodoro, Juan Carlos A2 Matemáticas K1 Roman domination K1 Total Roman domination K1 Outer independent Roman domination AB A double Roman dominating function (DRDF) on a graph G=(V, E) is a function f:V→ {0,1,2,3} satisfying (i) if f(v)=0, then there must be at least two neighbors assigned 2 under f or one neighbor w with f(w)=3; and (ii) if f(v)=1 then v must be adjacent to a vertex w, such that f(w)≥2. A DRDF is an outer independent total double Roman dominating function (OITDRDF) on G if the setof vertices labeled 0 induces an edgeless subgraph and the subgraph induced by the vertices with a non-zero label has no isolated vertices. The weight of an OITDRDF is the sum of its function values over all vertices, and the outer independent total Roman dominating number is the minimum weight of an OITDRDF on G. First, we show that the problem of determining this variant of the domination number is NP-complete for bipartite and chordal graphs. Then, we show that it is solvable in linear time when we are restricting to bounded clique-width graphs. Moreover, we present some tight bounds as well as the exact values for several graph families. PB Springer Nature Switzerland AG SN 1660-5454 YR 2023 FD 2023-03-24 LK http://hdl.handle.net/10498/31046 UL http://hdl.handle.net/10498/31046 LA eng DS Repositorio Institucional de la Universidad de Cádiz RD 17-nov-2026