With the aid of hypergraph transversals it is proved that γt(Qn+1)=2γ(Qn), where γt(G) and γ(G) denote the total domination number and the domination number of G, respectively, and Qn is the n-dimensional hypercube. More generally, it is shown that if G is a bipartite graph, then γt(G□K2)=2γ(G). Further, we show that the bipartite condition is essential by constructing, for any k≥1, a (non-bipartite) graph G such that γt(G□K2)=2γ(G)−k. Along the way several domination-type identities for hypercubes are also obtained.
@article{arxiv.1606.08143,
title = {(Total) Domination in Prisms},
author = {Jernej Azarija and Michael A. Henning and Sandi Klavžar},
journal= {arXiv preprint arXiv:1606.08143},
year = {2016}
}