On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks
In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an arbitrary vertex stopped working and selected...
Saved in:
Main Authors: | Hua Wang, Muhammad Azeem, Muhammad Faisal Nadeem, Ata Ur-Rehman, Adnan Aslam |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2021/9939559 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fault-Tolerant Partition Resolvability of Cyclic Networks
by: Kamran Azhar, et al.
Published: (2021-01-01) -
Fault-Tolerant Resolvability of Swapped Optical Transpose Interconnection System
by: Iffat Fida Hussain, et al.
Published: (2022-01-01) -
Minimal Doubly Resolving Sets of Some Classes of Convex Polytopes
by: Muhammad Ahmad, et al.
Published: (2022-01-01) -
New Perspectives on Classical Meanness of Some Ladder Graphs
by: A. M. Alanazi, et al.
Published: (2021-01-01) -
On the Constant Partition Dimension of Some Generalized Families of Toeplitz Graph
by: Ali N. A. Koam, et al.
Published: (2024-01-01)