Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of domination multiproperty and multiset parameters sums and products of parameters dominating functions frameworks for domination domination complexity and algorithms.Expand

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

LP-duality, complementarity and generality of graphical subset parameters dominating functions in graphs fractional domination and related parameters majority domination and its generalizations… Expand

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network.Expand

In large organizations there is frequently a need to pass information from one place, e.g., the president’s office or company headquarters, to all other divisions, departments or employees.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