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

Abel Cabrera Martinez, Frank A. Hernandez Mira, Jose M. Sigarreta Almira +1

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 c…