Recent results on the power domination numbers of graph products
semanticscholar（2018）
摘要
We review recent results on the power domination problem of graph products and establish improved results for some families of graph products, namely, Cn × Cm, Pn × Cm, Pn Pm, Pn Cm and Cn Cm. We also characterize graphs G and H for which the power domination number of the Cartesian product of G and H, which is denoted as γp(G 2 H), is 1.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要