  A consequence of Ore's classic theorem characterizing the maximal graphs with
given order and diameter is a determination of the largest such graphs. We give
a very short and simple proof of this smaller result, based on a well-known
elementary observation.
