Resolvability In Subdivision Of Circulant Networks C-N[1, K]

Circulant networks form a very important and widely explored class of graphs due to their interesting and wide-range applications in networking, facility location problems, and their symmetric properties. A resolving set is a subset of vertices of a connected graph such that each vertex of the graph is determined uniquely by its distances to that set. A resolving set of the graph that has the minimum cardinality is called the basis of the graph, and the number of elements in the basis is called the metric dimension of the graph. In this paper, the metric dimension is computed for the graph G(n)[1, k] constructed from the circulant graph C-n[1, k] by subdividing its edges. We have shown that, for k. 2, G(n)[1, k] has an unbounded metric dimension, and for k. 3 and 4, G(n)[1, k] has a bounded metric dimension.