For an ordered subset W = {w 1 , w 2 , w 3 ,. .. , w k } of vertices in a connected graph G and a vertex v of G, the metric representation of v with respect to W is the k-vector r(v|W) = (d(v, w 1), d(v, w 2), d(v, w 3),. .. , d(v, w k)). The set W is called a resolving set of G if r(u|W) = r(v|W) implies u = v. The metric dimension of G, denoted by β(G), is the minimum cardinality of a resolving set of G. Let n ≥ 3 be an integer. A truncated wheel, denoted by T W n , is the graph with vertex set V (T W n) = {a} ∪ B ∪ C, where B = {b i : 1 ≤ i ≤ n} and C = {c j,k : 1 ≤ j ≤ n, 1 ≤ k ≤ 2}, and edge set E(T W n) = {ab i : 1 ≤ i ≤ n} ∪ {b i c i,k : 1 ≤ i ≤ n, 1 ≤ k ≤ 2} ∪ {c j,1 c j,2 : 1 ≤ j ≤ n} ∪ {c j,2 c j+1,1 : 1 ≤ j ≤ n}, where c n+1,1 = c 1,1. In this paper, we compute the metric dimension of truncated wheels.