Wiener index of graphs with fixed number of pendant or cut-vertices
The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. We characterize the graphs which extremize the Wiener index among all graphs on vertices with pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on vertices with cut-vertices.