Abstract:  The Wiener index of a graph is defined as the sum of distances between all pairs of vertices of the graph. It has been found extensive applications in chemistry. In this paper, we characterize the graphs which minimize the Wiener index among all graphs with given order and specific parameter, such as the chromatic number or clique number, and the graphs which maximize the Wiener index among all graphs with given order and clique number.