The total co-independent domination number of some graph operations

Thumbnail
Identificadores

URI: http://hdl.handle.net/10498/28809

DOI: 10.33044/revuma.1652

ISSN: 1669-9637

Files
Statistics
Metrics and citations
 
Share
Export
EndNoteBibTexRIS
Metadata
Show full item record
Author/s
Cabrera Martínez, Abel; Cabrera García, Suitberto; Peterin, Iztok; González Yero, IsmaelAuthority UCA
Date
2022-06
Department
Matemáticas
Source
Revista de la Unión Matemática Argentina, Vol. 63, Núm. 1, 2022, pp. 153-168
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
Collections