A subset $S\subseteq V(G)$ is a disjunctive total dominating set if each vertex has a neighbor in S or has at least two vertices in S at distance two from it. The disjunctive total domination number ${\gamma }_t^d(G)$ is the minimum cardinality of a disjunctive total dominating set in G. Disjunctive total bondage number, $b_t^d(G)$, of a graph G with no isolated vertex is defined as the minimum cardinality of edge set $B\subseteq E(G)$ whose deletion obtains a graph $G-B$ with no isolated vertex satisfying ${\gamma }_t^d(G-B)>{\gamma }_t^d(G)$. If there is no such set B, it is then defined as $b_t^d(G)=\infty$. We, in this paper, present some bounds on disjunctive total bondage. Also, we prove that the disjunctive total bondage problem is NP-complete, even for bipartite graphs.

一个子集 $\mathrm{小号}\subseteq \mathrm{伏特}（G）$是分离性总控制集如果每个顶点具有在邻居小号或具有至少两个顶点小号在从中距离的两个。该析取总控制数 ${\gamma }_{Ť}^d（G）$是G中析取性总支配集的最小基数。析取总束缚数，$b_{Ť}^d（G）$没有孤立顶点的图G的定义为边集的最小基数$乙\subseteq E（G）$ 其删除获得图 $G-乙$ 没有孤立的顶点令人满意 ${\gamma }_{Ť}^d（G-乙）>{\gamma }_{Ť}^d（G）$。如果没有这样的集合B，则将其定义为$b_{Ť}^d（G）=\infty$。在本文中，我们提出了析取总束缚的一些界限。此外，我们证明了析取的总束缚问题是NP完全的，即使对于二部图也是如此。