Abstract
The distance centric parameter in the theory of networks called by metric dimension plays a vital role in encountering the distance-related problems for the monitoring of the large-scale networks in the various fields of chemistry and computer science such as navigation, image processing, pattern recognition, integer programming, optimal transportation models and drugs discovery. In particular, it is used to find the locations of robots with respect to shortest distance among the destinations, minimum consumption of time, lesser number of the utilized nodes, and to characterize the chemical compounds, having unique presentations in molecular networks. After the arrival of its weighted version, known as fractional metric dimension, the rectification of distance-related problems in the aforementioned fields has revived to a great extent. In this article, we compute fractional as well as local fractional metric dimensions of web-related networks called by subdivided QCL, 2-faced web, 3-faced web, and antiprism web networks. Moreover, we analyse their final results using 2D and 3D plots.
Highlights
The rising sun of each day arrives with a bunch of advancements related to the arena of information and technology, cheminformatics, and medicines
Distance intervenes when we have to allocate robots to different sites known as landmarks without loss of economical operation cost and employing fewer robots. This objective is achieved by turning this whole situation into a graph-theoretic model and allowing metric dimension to give an appropriate picturesque model
We calculate the upper bounds of fractional metric dimension (FMD) as well as local fractional metric dimension (LFMD) of web-related networks called by subdivided divided quadrangular circular ladder (QCL), 2-faced web, 3-faced web, and antiprism web networks
Summary
The rising sun of each day arrives with a bunch of advancements related to the arena of information and technology, cheminformatics, and medicines. Distance intervenes when we have to allocate robots to different sites known as landmarks without loss of economical operation cost and employing fewer robots This objective is achieved by turning this whole situation into a graph-theoretic model and allowing metric dimension to give an appropriate picturesque model. We calculate the upper bounds of FMD as well as LFMD of web-related networks called by subdivided divided QCL, 2-faced web, 3-faced web, and antiprism web networks. These networks bear rotational symmetry and planarity, which will help in designing information and chemical structures.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
