Article ID Journal Published Year Pages File Type
4646515 AKCE International Journal of Graphs and Combinatorics 2016 9 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Power domination of the cartesian product of graphs
Authors
, ,