Classification of Upper Bound Sequences of Local Fractional Metric Dimension of Rotationally Symmetric Hexagonal Planar Networks

The term metric or distance of a graph plays a vital role in the study to check the structural properties of the networks such as complexity, modularity, centrality, accessibility, connectivity, robustness, clustering, and vulnerability. In particular, various metrics or distance-based dimensions of different kinds of networks are used to resolve the problems in different strata such as in security to find a suitable place for fixing sensors for security purposes. In the field of computer science, metric dimensions are most useful in aspects such as image processing, navigation, pattern recognition, and integer programming problem. Also, metric dimensions play a vital role in the field of chemical engineering, for example, the problem of drug discovery and the formation of different chemical compounds are resolved by means of some suitable metric dimension algorithm. In this paper, we take rotationally symmetric and hexagonal planar networks with all possible faces. We find the sequences of the local fractional metric dimensions of proposed rotationally symmetric and planar networks. Also, we discuss the boundedness of sequences of local fractional metric dimensions. Moreover, we summarize the sequences of local fractional metric dimension by means of their graphs.