Double Metric Resolvability in Convex Polytopes

Nowadays, the study of source localization in complex networks is a critical issue. Localization of the source has been investigated using a variety of feasible models. To identify the source of a network’s diffusion, it is necessary to find a vertex from which the observed diffusion spreads. Detect...

Full description

Saved in:
Bibliographic Details
Main Authors: Muhammad Ahmad, Dalal Alrowaili, Rifaqat Ali, Zohaib Zahid, Imran Siddique
Format: Article
Language:English
Published: Wiley 2022-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2022/5884924
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nowadays, the study of source localization in complex networks is a critical issue. Localization of the source has been investigated using a variety of feasible models. To identify the source of a network’s diffusion, it is necessary to find a vertex from which the observed diffusion spreads. Detecting the source of a virus in a network is equivalent to finding the minimal doubly resolving set (MDRS) in a network. This paper calculates the doubly resolving sets (DRSs) for certain convex polytope structures to calculate their double metric dimension (DMD). It is concluded that the cardinality of MDRSs for these convex polytopes is finite and constant.
ISSN:2314-4785