  The Wiener index of a connected graph is defined as the sum of the distances
between all unordered pair of its vertices. In this paper, we characterize the
graphs which extremize the Wiener index among all graphs on $n$ vertices with
$k$ pendant vertices. We also characterize the graph which minimizes the Wiener
index over the graphs on $n$ vertices with $s$ cut vertices.
