An upper bound is established on the parameter Gamma(-)(G) for a cubic
graph G and two infinite families of 3-connected graphs G(k), G(k) a
re constructed to show that the bound is sharp and, moreover, the diff
erence Gamma(-)(G(k)) - gamma(s)(G(k)*) can be arbitrarily large, whe
re Gamma(-)(G(k)) and gamma(s)(G(k)*) are the upper minus domination
and signed domination numbers of G(k), respectively. Thus two open pr
oblems are solved.