Packing constants in graphs and connectivity

We prove the following theorem: If G an r-connected graph and there are k vertices of G which have pairwise distance at least d, then G has at least k(r⌞(itd−1)/2⌟+1)+ ((1+(−1)d)/2)r vertices. This bound is sharp.