(Total) Domination in Prisms
Abstract
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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.