Computation of the double metric dimension in convex polytopes
type: Item
instance of: scholarly article
title: Computation of the double metric dimension in convex polytopes
zbMATH Open document ID: 1477.05066
DOI: 10.1155/2021/9958969
author: Yanyan Li
published in: Journal of Mathematics
publication date: 2021-11-24T00:00:00Z
review text: Summary: 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 \(R_n\) and \(Q_n\) by describing their minimal doubly resolving sets.
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7433109
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2021/9958969
OpenAlex ID: W3208565417
cites work: Q4119237
cites work: Q4075485
cites work: Landmarks in graphs
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: Q5535504
cites work: Mastermind
cites work: On Metric Generators of Graphs
cites work: On \(k\)-dimensional graphs and their bases
cites work: Q3530898
cites work: Q4924913
cites work: The Metric Dimension of Regular Bipartite Graphs
cites work: Q3089226
cites work: On families of convex polytopes with constant metric dimension
cites work: Computing the metric dimension of kayak paddles graph and cycles with chord
cites work: On the Metric Dimension of Cartesian Products of Graphs
cites work: Computing minimal doubly resolving sets of graphs
cites work: Minimal doubly resolving sets of prism graphs
cites work: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
cites work: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
cites work: Q5142452
cites work: Approximation for the minimum cost doubly resolving set problem
cites work: Computing edge version of metric and double metric dimensions of Kayak paddle graphs
cites work: Q4027145
cites work: Q4898130
description: scientific article; zbMATH DE number 7433109