On the Fractional Metric Dimension of Convex Polytopes

In order to identify the basic structural properties of a network such as connectedness, centrality, modularity, accessibility, clustering, vulnerability, and robustness, we need distance-based parameters. A number of tools like these help computer and chemical scientists to resolve the issues of informational and chemical structures. In this way, the related branches of aforementioned sciences are also benefited with these tools as well. In this paper, we are going to study a symmetric class of networks called convex polytopes for the upper and lower bounds of fractional metric dimension (FMD), where FMD is a latest developed mathematical technique depending on the graph-theoretic parameter of distance. Apart from that, we also have improved the lower bound of FMD from unity for all the arbitrary connected networks in its general form.