  In this article, we determine the maximum Wiener indices of unicyclic graphs
with given number of vertices and matching number. We also characterize the
extremal graphs. This solves an open problem of Du and Zhou.
