Graph theory as part of mathematics, has experienced significant development from the theoretical aspect, one of it is the theory of metric dimension. The concept of metric dimensions has evolved greatly, including the dominant metric dimension and the complement metric dimension. In this study, the concept of the central metric dimension is introduced, that is a combination of the metric dimension and central of a graph. The minimum number of vertices of a resolver set that contains a central set is called the central metric dimension of graph G, and denoted by dimcen(G). Several characterizations of a graph having a certain central metric dimension are yielded in this study. Several relations are obtained between the central metric dimension and the metric dimension. Furthermore, the central metric dimension is applied on edge coronation graphs. The edge coronation of graphs G and H is denoted by (G ◊ H). The results of the study show that the central metric dimension of edge coronation of G and H are influenced by the central set and the order of graph G and the metric dimension of graph H.