Edge metric dimension of some classes of circulant graphs

Abstract

Abstract Let G = (V (G), E(G)) be a connected graph and x, y ∈ V (G), d(x, y) = min{ length of x − y path } and for e ∈ E(G), d(x, e) = min{d(x, a), d(x, b)}, where e = ab. A vertex x distinguishes two edges e 1 and e 2, if d(e 1, x) ≠ d(e 2, x). Let WE = {w 1, w 2, . . ., wk } be an ordered set in V (G) and let e ∈ E(G). The representation r(e | WE ) of e with respect to WE is the k-tuple (d(e, w 1), d(e, w 2), . . ., d(e, wk )). If distinct edges of G have distinct representation with respect to WE , then WE is called an edge metric generator for G. An edge metric generator of minimum cardinality is an edge metric basis for G, and its cardinality is called edge metric dimension of G, denoted by edim(G). The circulant graph Cn (1, m) has vertex set {v 1, v 2, . . ., vn } and edge set {vivi +1 : 1 ≤ i ≤ n−1}∪{vnv 1}∪{vivi+m : 1 ≤ i ≤ n−m}∪{vn−m+ivi : 1 ≤ i ≤ m}. In this paper, it is shown that the edge metric dimension of circulant graphs Cn (1, 2) and Cn (1, 3) is constant.