RT journal article
T1 The total co-independent domination number of some graph operations
A1 Cabrera Martínez, Abel
A1 Cabrera García, Suitberto
A1 Peterin, Iztok
A1 González Yero, Ismael
A2 Matemáticas
AB 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
PB UNION MATEMATICA ARGENTINA
SN 1669-9637
YR 2022
FD 2022-06
LK http://hdl.handle.net/10498/28809
UL http://hdl.handle.net/10498/28809
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 12-nov-2026