Abstract. The metric (edge metric) dimension dim(G) (edim(G) is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (edges) by means of distance vectors to such a set. In this paper for every a,b such that 4\le b < a we find a 2-connected graph G such that dim(G)=a and edim(G)=b.