Abstract
Assume that G=VG,EG is a connected graph. For a set of vertices W-E subset of V(G), two edges g(1),g(2 )is an element of E(G) are distinguished by a vertex x(1)is an element of W-E, if d(x(1),g(1))&NOTEQUexpressionL; d(x(1),g(2)). W-E is termed edge metric generator for G if any vertex of W-E distinguishes every two arbitrarily distinct edges of graph G. Furthermore, the edge metric dimension of G, indicated by edimG, is the cardinality of the smallest W-E for G. The edge metric dimensions of the dragon, kayak paddle, cycle with chord, generalized prism, and necklace graphs are calculated in this article.