Three-valued k-neighborhood domination in graphs

@article{Hattingh1994ThreevaluedKD,
  title={Three-valued k-neighborhood domination in graphs},
  author={Johannes H. Hattingh and Michael A. Henning and Peter J. Slater},
  journal={Australasian J. Combinatorics},
  year={1994},
  volume={9},
  pages={233-242}
}
Let k~l be an integer, and let G = (V, E) be a graph. The closed kneighborhood N k[V] of a vertex v E V is the set of vertices within distance k from v. A 3-valued function f defined on V of the form f : V --+ { -1,0, I} is a three-valued k-neighborhood dominating function if the sum of its function values over any closed k-neighborhood is at least 1. The… CONTINUE READING