Power domination of the cartesian product of graphs

AKCE International Journal of Graphs and Combinatorics（2016）

引用 8|浏览5

暂无评分

摘要

In this paper, we first give a brief survey on the power domination of the Cartesian product of graphs. Then we conjecture a Vizing-like inequality for the power domination problem, and prove that the inequality holds when at least one of the two graphs is a tree.

查看译文

关键词

Power domination,Cartesian product,Vizing’s Inequality,Corona

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要