... δ) is a non-increasing function in δ. We are interested in determining the numbers δk(n)whereδk(n)=max{δ |γ(n, δ) ≥ k},k≥ 1.Since the domination number of an (n, δ)-graph G is 1 if and ... +1≥√2n −1.Since this is larger that the previous bound, we obtain the desired lower bound for |T |. The following theorem is immediate from Lemmas 3 and 5.Theorem 8 If T ⊂ Zn, n ≥ 6 is a symmetric, ... Actually there were six undecided entries in the table given in [2], three of which are decided in Section 5 of this paper. The remainingthree unknown entries are marked by asterisks. The values...