Discrete MathematicsVolume 137, Issues 1–3, 20 January 1995, Pages 353-355NotePacking constants in graphs and connectivityAuthor links open overlay panelPeter BrassShow moreShareCitehttps://doi.org/10.1016/0012-365X(93)E0135-QGet rights and contentUnder an Elsevier user licenseopen archiveAbstractWe 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.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1995 Published by Elsevier B.V.