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

In a graph G = (V, E) if we think of each vertex s as the possible location for a guard capable of protecting each vertex in its closed neighborhood N[s], then “domination” requires every vertex to… 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

A double Roman dominating function is a function f with the property that if f ( v ) = 0 , then vertex v must have at least two neighbors assigned 2 under f or one neighbor with f ( w ) = 3 under f .Expand