Author:
Azarija Jernej,Henning Michael,Klavžar Sandi
Abstract
Using hypergraph transversals it is proved that $\gamma_t(Q_{n+1}) = 2\gamma(Q_n)$, where $\gamma_t(G)$ and $\gamma(G)$ denote the total domination number and the domination number of $G$, respectively, and $Q_n$ is the $n$-dimensional hypercube. More generally, it is shown that if $G$ is a bipartite graph, then $\gamma_t(G \square K_2) = 2\gamma(G)$. Further, we show that the bipartiteness condition is essential by constructing, for any $k \ge 1$, a (non-bipartite) graph $G$ such that $\gamma_t(G\square K_2) = 2\gamma(G) - k$. Along the way several domination-type identities for hypercubes are also obtained.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Characterization of locating connected domination number on cyclic graphs;3RD INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS (e-ICMTA-2022);2023
2. Domination in Rose Window Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2020-06-24
3. Saving Probe Bits by Cube Domination;Graph-Theoretic Concepts in Computer Science;2018
4. A note on domination and total domination in prisms;Journal of Combinatorial Optimization;2017-06-29