科研之友
微信
新浪微博
Facebook
分享链接
摘要
Recently, Azarija et al. (Electron J Combin:1.19, 2017) considered the prism of a graph G and showed that if G is bipartite, where and are the total domination number and the domination number of G. In this note, we give a simple proof and observe that there are similar results for other pairs of parameters. We also answer a question from that paper and show that for all graphs , and this bound is tight.
- 出版日期2018-1
