Computation of the Double Metric Dimension in Convex Polytopes

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Liying Pan, Muhammad Ahmad, Zohaib Zahid, Sohail Zafar
Formato: article
Lenguaje:EN
Publicado: Hindawi Limited 2021
Materias:
Acceso en línea:https://doaj.org/article/f54489b201c44742a47647426ab0f791
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:f54489b201c44742a47647426ab0f791
record_format dspace
spelling oai:doaj.org-article:f54489b201c44742a47647426ab0f7912021-11-08T02:37:03ZComputation of the Double Metric Dimension in Convex Polytopes2314-478510.1155/2021/9958969https://doaj.org/article/f54489b201c44742a47647426ab0f7912021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/9958969https://doaj.org/toc/2314-4785A 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.Liying PanMuhammad AhmadZohaib ZahidSohail ZafarHindawi LimitedarticleMathematicsQA1-939ENJournal of Mathematics, Vol 2021 (2021)
institution DOAJ
collection DOAJ
language EN
topic Mathematics
QA1-939
spellingShingle Mathematics
QA1-939
Liying Pan
Muhammad Ahmad
Zohaib Zahid
Sohail Zafar
Computation of the Double Metric Dimension in Convex Polytopes
description 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.
format article
author Liying Pan
Muhammad Ahmad
Zohaib Zahid
Sohail Zafar
author_facet Liying Pan
Muhammad Ahmad
Zohaib Zahid
Sohail Zafar
author_sort Liying Pan
title Computation of the Double Metric Dimension in Convex Polytopes
title_short Computation of the Double Metric Dimension in Convex Polytopes
title_full Computation of the Double Metric Dimension in Convex Polytopes
title_fullStr Computation of the Double Metric Dimension in Convex Polytopes
title_full_unstemmed Computation of the Double Metric Dimension in Convex Polytopes
title_sort computation of the double metric dimension in convex polytopes
publisher Hindawi Limited
publishDate 2021
url https://doaj.org/article/f54489b201c44742a47647426ab0f791
work_keys_str_mv AT liyingpan computationofthedoublemetricdimensioninconvexpolytopes
AT muhammadahmad computationofthedoublemetricdimensioninconvexpolytopes
AT zohaibzahid computationofthedoublemetricdimensioninconvexpolytopes
AT sohailzafar computationofthedoublemetricdimensioninconvexpolytopes
_version_ 1718443057550983168