1. N. Alon, private communication.
2. E.J. Cockayne and C. Mynhardt, On a generalization of signed dominating functions of graphs, Ars Combin., to appear.
3. J.E. Dunbar, S.T. Hedetniemi, M.A. Henning and A.A. McRae, Minus domination in graphs, Comput. Math. Appl., to appear.
4. J.E. Dunbar, S.T. Hedetniemi, M.A. Henning, and P.J. Slater, Signed domination in graphs, Proc. 7th Internat. Conf. in Graph Theory, Combinatorics, Algorithms, and Applications, to appear.
5. Computers and Intractability: A Guide to the Theory of NP-completeness;Garey,1979