The total co-independent domination number of some graph operations

[EN] 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.I. Peterin was partially supported by ARRS Slovenia under grants P1-0297 and J1-9109; I. G. Yero was partially supported by Junta de Andalucia, FEDER-UPO Research and Development Call, reference number UPO-1263769.Cabrera Martinez, A.; Cabrera García, S.; Peterin, I.; Yero, IG. (2022). The total co-independent domination number of some graph operations. Revista de la Unión Matemática Argentina. 63(1):153-158. https://doi.org/10.33044/revuma.165215315863