Generalized domination and efficient dom
β
D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater
π
Article
π
1996
π
Elsevier Science
π
English
β 516 KB
This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called