  Let $\{0,1,\dots, t\}$ be abbreviated by $[t].$ A double Roman dominating
function (DRDF) on a graph $\Gamma=(V,E)$ is a map $l:V\rightarrow [3]$
satisfying \textrm{(i)} if $l(r)=0$ then there must be at least two neighbors
labeled 2 under $l$ or a neighbor $r'$ with $l(r')=3$; and \textrm{(ii)} if
$l(r)=1$ then $r$ must be adjacent to a vertex $r'$ such that $l(r')\geq2$. A
DRDF is an outer-independent total double Roman dominating function (OITDRDF)
on $\Gamma$ if the set of 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 map values over all
vertices, and the outer independent total Roman dominating number
$\gamma_{tdR}^{oi}(\Gamma)$ is the minimum weight of an OITDRDF on $\Gamma$.
First, we prove that the problem of determining $\gamma _{tdR}^{oi}(\Gamma)$ is
NP-complete for bipartite and chordal graphs, after that, we prove that it is
solvable in linear time when we are restricting to bounded clique-width graphs.
Moreover, we present some tight bounds on $\gamma _{tdR}^{oi}(\Gamma)$ as well
as the exact values for several graph families.
