English

(Total) Domination in Prisms

Combinatorics 2016-06-28 v1

Abstract

With the aid of hypergraph transversals it is proved that γt(Qn+1)=2γ(Qn)\gamma_t(Q_{n+1}) = 2\gamma(Q_n), where γt(G)\gamma_t(G) and γ(G)\gamma(G) denote the total domination number and the domination number of GG, respectively, and QnQ_n is the nn-dimensional hypercube. More generally, it is shown that if GG is a bipartite graph, then γt(GK2)=2γ(G)\gamma_t(G \square K_2) = 2\gamma(G). Further, we show that the bipartite condition is essential by constructing, for any k1k \ge 1, a (non-bipartite) graph GG such that γt(GK2)=2γ(G)k\gamma_t (G \square K_2 ) = 2\gamma(G) - k. Along the way several domination-type identities for hypercubes are also obtained.

Keywords

Cite

@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}
}
R2 v1 2026-06-22T14:34:46.271Z