摘要

The Wiener index of a connected graph is defined as the sum of all distances between unordered pairs of vertices. We determine the unicyclic graphs of given order, cycle length and number of pendent vertices with minimum Wiener index.