Abstract
Let G = (V;E) be a connected graph, let x is an element of V (G) be a vertex and e = yz is an element of E(G) be an edge. The distance between the vertex x and the edge e is given by dG(x; e) = min {d(G)(x, y), d(G)(x, z)g: A vertex t is an element of V (G) distinguishes two edges e, f is an element of E(G) if d(G)(t, e) not equal d(G)(t, f): A set R subset of V (G) is an edge metric generator for G if every two edges of G are distinguished by some vertex of R. The minimum cardinality of R is called the edge metric dimension and is denoted by edim(G): In this paper, we compute the edge metric dimension of barycentric subdivision of Cayley graphs C-ay(Z(n) circle plus Z(2)).