The total co-independent domination number of some graph operations
- Abel Cabrera Martínez 1
- Suitberto Cabrera García 2
- Iztok Peterin 3
- Ismael G. Yero 4
- 1 Universitat Rovira i Virgili, Spain
- 2 Universitat Politècnica de València, Spain
- 3 University of Maribor, Slovenia
- 4 Universidad de Cádiz, Spain
ISSN: 1669-9637, 0041-6932
Argitalpen urtea: 2022
Alea: 63
Zenbakia: 1
Orrialdeak: 153-168
Mota: Artikulua
Beste argitalpen batzuk: Revista de la Unión Matemática Argentina
Laburpena
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.