Resolvability in Subdivision Graph of Circulant Graphs
Syed Ahtsham Ul Haq Bokhary, Khola Wahid, Usman Ali, Shreefa O. Hilali, Mohammed Alhagyan, Ameni Gargouri · Symmetry · 2023
Circulant networks are a very important and widely studied class of graphs due to their interesting and diverse applications in networking, facility location problems, and their symmetric properties. The structure of the graph ensures that it is symmetric about any line that cuts the graph into two equal parts. Due to this symmetric behavior, the resolvability of these graph becomes interning. Subdividing an edge means inserting a new vertex on the edge that divides it into two edges. The subdivision graph G is a graph formed by a series of edge subdivisions. In a graph, a resolving set is a set that uniquely identifies each vertex of the graph by its distance from the other vertices. A metric basis is a resolving set of minimum cardinality, and the number of elements in the metric basis is referred to as the metric dimension. This paper determines the minimum resolving set for the graphs Hl[1,k] constructed from the circulant graph Cl[1,k] by subdividing its edges. We also proved that, for k=2,3, this graph class has a constant metric dimension.