| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421056 | Discrete Applied Mathematics | 2006 | 5 Pages |
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, M.A. Henning, Power domination in graphs applied to electrical power networks, SIAM J. Discrete Math. 15(4) (2002) 519–529]). A set SS of vertices is defined to be a power dominating set of a graph if every vertex and every edge in the system is monitored by the set SS (following a set of rules for power system monitoring). The minimum cardinality of a power dominating set of a graph is its power domination number. In this paper, we determine the power domination number of an n×mn×m grid graph.
