# On computational and combinatorial properties of the total co-independent domination number of graphs

## TL;DR

This paper investigates the properties and computational complexity of the total co-independent domination number in graphs, proving NP-completeness of related decision problems and characterizing trees with equal domination numbers.

## Contribution

It introduces the concept of total co-independent domination number, proves NP-completeness of its decision problem, and characterizes trees where this number equals the total domination number.

## Key findings

- Deciding if _{t,coi}(G)  k is NP-complete.
- Provides bounds on _{t,coi}(G).
- Characterizes trees with equal total co-independent and total domination numbers.

## Abstract

A subset $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total dominating set $D$ is called a total co-independent dominating set if the subgraph induced by $V-D$ is edgeless and has at least one vertex. The minimum cardinality of any total co-independent dominating set is the total co-independent domination number of $G$ and is denoted by $\gamma_{t,coi}(G)$. In this work we study some complexity and combinatorial properties of $\gamma_{t,coi}(G)$. Specifically, we prove that deciding whether $\gamma_{t,coi}(G)\le k$ for a given integer $k$ is an NP-complete problem and give several bounds on $\gamma_{t,coi}(G)$. Also, since any total co-independent dominating set is also a total dominating set, we characterize all the trees having equal total co-independent domination number and total domination number.