The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to vertex covering and dominating set problems in graphs.Expand

Assume we have a set of $k$ colors and to each vertex of a graph $G$ we assign an arbitrary subset of these colors. If we require that each vertex to which an empty set is assigned has in its… Expand

A defensive alliance in a graph G =( V,E) is a set of vertices S V satisfying the condition that for every vertex v 2 S, the number of neighbors v has in S plus one (counting v) is at least as large as the number the neighbors it has in V S.Expand

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.Expand