Minimal Doubly Resolving Sets of Some Classes of Convex Polytopes

Muhammad Ahmad, Dalal Alrowaili, Zohaib Zahid, Imran Siddique, Aiyared Iampan and Gohar Ali

Journal of Mathematics, 2022, vol. 2022, 1-13

Abstract: Source localization is one of the most challenging problems in complex networks. Monitoring and controlling complex networks is of great interest for understanding different types of systems, such as biological, technological, and complex physical systems. Modern research has made great developments in identifying sensors through which we can monitor or control complex systems. For this task, we choose a set of sensors with the smallest possible size so that the source may be identified. The problem of locating the source of an epidemic in a network is equivalent to the problem of finding the minimal doubly resolving sets (MDRSs) in a network. In this paper, we calculate the minimal doubly resolving sets (MDRSs) of some classes of convex polytopes in order to compute their double metric dimension (DMD).

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/1818734.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/1818734.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:1818734

DOI: 10.1155/2022/1818734

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().