@misc{10498/28809,
year = {2022},
month = {6},
url = {http://hdl.handle.net/10498/28809},
abstract = {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},
publisher = {UNION MATEMATICA ARGENTINA},
title = {The total co-independent domination number of some graph operations},
doi = {10.33044/revuma.1652},
author = {Cabrera Martínez, Abel and Cabrera García, Suitberto and Peterin, Iztok and González Yero, Ismael},
}