metric dimension of C_n(۱‎, ‎۲‎, ‎۳) for n \equiv ۰ \pmod{۶}

The metric dimension of a connected graph G is the minimum number of vertices in a subset B of G such that all other vertices are uniquely determined by their distances to the vertices in B. In this case, B is called a metric basis for G and written dim(G)=\Vert B\Vert. We have solved an open problem which shows dimension of circulant graph, dim(C_n(۱,۲,۳))=۴, n \equiv ۰ \pmod{۶}. To prove this result, we employ a combination of combinatorial techniques, including distance-based analysis and structural properties of circulant graphs, to carefully analyze the relationship between the graphs structure and its metric dimension. The solution not only answers a previously unresolved question in graph theory but also provides valuable insights into the metric dimensions of more general classes of graphs, particularly in network theory, where understanding the metric dimension is essential for applications in sensor networks, graph-based data storage, and network routing. This work lays the groundwork for future research on the metric dimensions of other families of graphs and has potential applications in optimizing communication and sensor placement in large-scale networks.

کلیدواژه ها:

Metric dimension ، resolving set ، metric basis ، circulant graph