Abstract:
For the $n$-vertex usual connected graphs with diameter $d$ the exact upper estimates of the number of different balls of given radius are obtained from investigation of the location of the centers of distinct balls. Ill. 5, bibl. 7.
Keywords:graph, diameter of the graph, metric ball, radius of the ball, number of balls, estimates.