Boundedness of Convex Polytopes Networks via Local Fractional Metric Dimension

Metric dimension is one of the distance-based parameter which is frequently used to study the structural and chemical properties of the different networks in the various fields of computer science and chemistry such as image processing, pattern recognition, navigation, integer programming, optimal transportation models, and drugs discovery. In particular, it is used to find the locations of robots with respect to shortest distance among the destinations, minimum consumption of time, and lesser number of the utilized nodes and to characterize the chemical compounds having unique presentation in molecular networks. The fractional metric dimension being a latest developed weighted version of the metric dimension is used in the distance-related problems of the aforementioned fields to find their nonintegral optimal solutions. In this paper, we have formulated the local resolving neighborhoods with their cardinalities for all the edges of the convex polytopes networks to compute their local fractional metric dimensions in the form of exact values and sharp bounds. Moreover, the boundedness of all the obtained results is also proved.