The total co-independent domination number of some graph operations

dc.contributor.author	Cabrera Martínez, Abel
dc.contributor.author	Cabrera García, Suitberto
dc.contributor.author	Peterin, Iztok
dc.contributor.author	González Yero, Ismael
dc.contributor.other	Matemáticas	es_ES
dc.date.accessioned	2023-06-13T11:49:00Z
dc.date.available	2023-06-13T11:49:00Z
dc.date.issued	2022-06
dc.identifier.issn	1669-9637
dc.identifier.uri	http://hdl.handle.net/10498/28809
dc.description.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	es_ES
dc.format	application/pdf	es_ES
dc.language.iso	eng	es_ES
dc.publisher	UNION MATEMATICA ARGENTINA	es_ES
dc.source	Revista de la Unión Matemática Argentina, Vol. 63, Núm. 1, 2022, pp. 153-168	es_ES
dc.title	The total co-independent domination number of some graph operations	es_ES
dc.type	journal article	es_ES
dc.rights.accessRights	open access	es_ES
dc.identifier.doi	10.33044/revuma.1652
dc.relation.projectID	info:eu-repo/grantAgreement/UPO//UPO-1263769/	es_ES
dc.type.hasVersion	VoR	es_ES