Minimal Doubly Resolving Sets of Some Classes of Convex Polytopes
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/1818734 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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). |
|---|---|
| ISSN: | 2314-4785 |