The heuristic blackball bound/number of [H.sub.P] is B(n) = |[S.sub.P](n)| - F(n).
Our measure, the blackball number, is proper as well.
A first observation on domination number analysis is that, considering the blackball number B(n) instead of the domination number F(n), we deal only with feasible solutions.
When the comparison of several algorithms for a given problem is the issue, it seems like the domination number, or more exactly the blackball number, gives us enough information to rank the algorithms.
Consider the blackball ratio (i.e., the complement to 1 of the domination ratio).