Abstract. A graph is chemical if its maximum degree is 4. We show that if a chemical graph on n vertices has the minimum value of Wiener index, then it has at most 3 vertices of degree smaller than 4. We give computer results as well as theoretical results for the problem in the class of k-regular graphs. Here, the minimum value is obtained by Cayley graphs in some cases.