(Total) domination in prisms

From MaRDI portal
Publication:510330




Abstract: With the aid of hypergraph transversals it is proved that gammat(Qn+1)=2gamma(Qn), where gammat(G) and gamma(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 gammat(GsquareK2)=2gamma(G). Further, we show that the bipartite condition is essential by constructing, for any kge1, a (non-bipartite) graph G such that gammat(GsquareK2)=2gamma(G)k. Along the way several domination-type identities for hypercubes are also obtained.









This page was built for publication: (Total) domination in prisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510330)