Total domination in the Cartesian product of a graph and K2or Cn
Abstract
Let G□H denote the Cartesian product of graphs G and H and γt(H) denote the total domination number of H. In this paper, we characterize all graphs H which satisfy γt(K2 □ H) = γt(H) and γt(Cn) γt(H) = 2γt(Cn □ H), respectively.











