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: | Muhammad Ahmad, Dalal Alrowaili, Zohaib Zahid, Imran Siddique, Aiyared Iampan |
---|---|
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!
|
Similar Items
-
On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs
by: Dalal Alrowaili, et al.
Published: (2022-01-01) -
Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of the Layer Sun Graph
by: Jia-Bao Liu, et al.
Published: (2020-01-01) -
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
by: Sakander Hayat, et al.
Published: (2021-01-01) -
Bounded Doubly Close-to-Convex Functions
by: Dorina Răducanu
Published: (2014-01-01) -
Computing Edge Version of Resolvability and Double Resolvability of a Graph
by: Muhammad Ahmad, et al.
Published: (2022-01-01)