We consider the problem of determining the maximum number of vertices
in a planar graph with given maximum degree Delta and diameter k. This
number has previously been exactly determined when k = 2. We show her
e that when k = 3, the number is roughly between 4.5 Delta and 8 Delta
. We also show that in general the number is Theta(Delta([k/2])) for a
ny fixed value of k.