Abstract

With the aid of hypergraph transversals it is proved that γt(Qn+1)=2γ(Qn)γ_t(Q_{n+1}) = 2γ(Q_n), where γt(G)γ_t(G) and γ(G)γ(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(G□K2)=2γ(G)γ_t(G \square K_2) = 2γ(G). Further, we show that the bipartite condition is essential by constructing, for any k≥1k \ge 1, a (non-bipartite) graph GG such that γt(G□K2)=2γ(G)−kγ_t (G \square K_2 ) = 2γ(G) - k. Along the way several domination-type identities for hypercubes are also obtained.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.