Edge-Version of Fault-Tolerant Resolvability in Networks [PDF]
Fault tolerance refers to a system’s capacity to continue functioning as intended, even when one of its components fails. Such a system is known as a fault-tolerant, self-stable system.
Muhammad Faheem +4 more
doaj +4 more sources
All metric bases and fault-tolerant metric dimension for square of grid [PDF]
For a simple connected graph \(G=(V,E)\) and an ordered subset \(W = \{w_1,w_2,\ldots, w_k\}\) of \(V\), the code of a vertex \(v\in V\), denoted by \(\mathrm{code}(v)\), with respect to \(W\) is a \(k\)-tuple \((d(v,w_1),\ldots, d(v, w_k))\), where \(d ...
Laxman Saha +2 more
doaj +3 more sources
Fault-Tolerant Resolvability in Some Classes of Subdivision Graphs [PDF]
The concept of resolving sets (RSs) and metric dimension (MD) invariants have a wide range of applications in robot navigation, computer networks, and chemical structure. RS has been used as a sensor in an indoor positioning system to find an interrupter.
Muhammad Faheem +4 more
doaj +2 more sources
Computation of Edge Resolvability of Benzenoid Tripod Structure [PDF]
In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively.
Ali Ahmad +4 more
doaj +2 more sources
Computation of Resolvability Parameters for Benzenoid Hammer Graph [PDF]
A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +2 more sources
Benchmarking quantum logic operations relative to thresholds for fault tolerance [PDF]
Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the ...
Akel Hashim +8 more
doaj +3 more sources
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs [PDF]
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock states, from ...
Fuad Abujarad +2 more
doaj +3 more sources
Investigating the Metric and Fault-Tolerant Dimensions in Para-Line Network Topologies [PDF]
The resolving set (RS) and metric dimension (MD) are critical concepts used in various fields such as computer networks, robot navigation, chemical structures, communication networks, transportation, and electric circuits.
M. Faheem +5 more
doaj +2 more sources
Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings [PDF]
In recent years, the intersection of algebraic structures and graph-theoretic concepts has developed significant interest, particularly through the study of zero-divisor graphs derived from commutative rings.
Omaima Alshanquiti +2 more
doaj +2 more sources
Fault-Tolerant Fuzzy Resolving Domination Set
Lenka Čepová +2 more
exaly +2 more sources

