Computing Sharp Bounds of Metric Based Fractional Dimensions for the Sierpinski Networks

摘要

The concept of metric dimension is widely applied to solve various problems in the different fields of computer science and chemistry, such as computer networking, integer programming, robot navigation, and the formation of chemical structuring. In this article, the local fractional metric dimension (LFMD) of the cycle-based Sierpinski networks is computed with the help of its local resolving neighborhoods of all the adjacent pairs of vertices. In addition, the boundedness of LFMD is also examined as the order of the Sierpinski networks approaches infinity.