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. [1] Universitat Rovira i Virgili

     Universitat Rovira i Virgili

     Tarragona, España

     
  2. [2] Universidad Politécnica de Valencia

     Universidad Politécnica de Valencia

     Valencia, España

     
  3. [3] University of Maribor

     University of Maribor

     Eslovenia

     
  4. [4] Universidad de Cádiz

     Universidad de Cádiz

     Cádiz, España

     

  Mostrar afiliaciones +
• Localización: Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 63, Nº. 1, 2022, págs. 153-168
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.