Edge metric dimension of some classes of circulant graphs

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 e1 and e2, if d(e1, x) ≠ d(e2, x). Let WE = {w1, w2, . . ., 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, w1), d(e, w2), . . ., 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 {v1, v2, . . ., vn} and edge set {vivi+1 : 1 ≤ i ≤ n−1}∪{vnv1}∪{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.

On the Edge Metric Dimension of Certain Polyphenyl Chains

“…Kratica et al worked on the edim of generalized Petersen graphs in [18]. Ahsan et al studied the edim of circulant graphs C n (1, k) for k � 1 and 2 (see [19]). Yang et al calculated the edim of some families of wheel-related graphs in [20].…”

On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs

“…Zubrilina in [20] calculated the n − 1 edim of graphs which has order n. Filipovic et al in [21] calculated the constant value of edim of graph GP(n, k) for fixed values of k and computed the lower bound for the rest of the values of k. Ahsan et al in [22] worked on the bounded and unbounded edim of some graphs. In addition, Ahsan et al in [23] calculated the constant edim of two regular graphs. Mufti et al in [24] computed the edim(BS(Cay(z n ⊕z 2 ))) of Cayley graphs.…”