Sharp Bounds of Local Fractional Metric Dimensions of Connected Networks

Metric dimension is a distance based parameter which is used to determine the locations of machines (or robots) with respect to minimum consumption of time, shortest distance among the destinations and lesser number of the utilized nodes as places of the objects. It is also used to characterize the chemical compounds in the molecular networks in the form of their unique presentations. These are problems worth investigating in different strata of computer science and chemistry such as navigation, combinatorial optimization, pattern recognition, image processing, integer programming, network theory and drugs discovery. In this paper, a general computational criteria is established to compute the local fractional metric dimension (LFMD) of connected networks in the form of sharp lower and upper bounds. A complete characterization of the connected networks whose LFMDs attain the exactly lower bound is obtained and some particular classes of networks (complete networks, generalized windmill and <inline-formula> <tex-math notation="LaTeX">$h$ </tex-math></inline-formula>-level windmill) whose LFMDs attain the exactly upper bound are also addressed. In the consequence of the main obtained criteria, LFMDs of wheel-related networks (anti-web gear, <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula>-level wheel, prism, helm and flower) are computed and their boundedness (or un-boundedness) is also illustrated with the help of 2D and 3D graphical presentations.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.