Computation of the Double Metric Dimension in Convex Polytopes

Liying Pan, Muhammad Ahmad, Zohaib Zahid, Sohail Zafar and Kenan Yildirim

Journal of Mathematics, 2021, vol. 2021, 1-11

Abstract: A source detection problem in complex networks has been studied widely. Source localization has much importance in order to model many real-world phenomena, for instance, spreading of a virus in a computer network, epidemics in human beings, and rumor spreading on the internet. A source localization problem is to identify a node in the network that gives the best description of the observed diffusion. For this purpose, we select a subset of nodes with least size such that the source can be uniquely located. This is equivalent to find the minimal doubly resolving set of a network. In this article, we have computed the double metric dimension of convex polytopes Rn and Qn by describing their minimal doubly resolving sets.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/9958969.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/9958969.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:9958969

DOI: 10.1155/2021/9958969

Access Statistics for this article

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