%0 Journal Article 
%A Cabrera Martínez, Abel
%A Cabrera García, Suitberto
%A Peterin, Iztok
%A González Yero, Ismael
%T The total co-independent domination number of some graph operations
%D 2022
%@ 1669-9637
%U http://hdl.handle.net/10498/28809
%X A set 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 (G)- D is edgeless. The minimum cardinality among all total co-independent dominating sets of G is the total co-independent domination number of G. In this article we study the total co-independent domination number of the join, strong, lexicographic, direct and rooted products of graphs
%~ Universidad de Cádiz