Bounds on Fractional-Based Metric Dimension of Petersen Networks
Dalal Awadh Alrowaili, Mohsin Raza, Muhammad Javaid · Computer Modeling in Engineering & Sciences · 2022
The problem of investigating the minimum set of landmarks consisting of auto-machines (Robots) in a connected network is studied with the concept of location number or metric dimension of this network. In this paper, we study the latest type of metric dimension called as local fractional metric dimension (LFMD) and find its upper bounds for generalized Petersen networks GP(n, 3), where n ≥ 7. For n ≥ 9. The limiting values of LFMD for GP(n, 3) are also obtained as 1 (bounded) if n approaches to infinity.