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 +4 more sources
Optimizing emergency response services in urban areas through the fault-tolerant metric dimension of hexagonal nanosheet [PDF]
In this work, we find the fault-tolerant metric dimension of a hexagonal nanosheet. This concept ensures robust identity of vertices inside a graph, even in situations in which a few resolving vertices fail.
Yaoyao Tu +5 more
doaj +2 more sources
Fault-Tolerant Resolvability and Extremal Structures of Graphs
In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric dimension n, n − 1 , and 2, which are the lower and upper extremal cases.
Hassan Raza +3 more
doaj +3 more sources
Robust mesh generation for electromagnetic models with geometric defects through node alignment and mesh boolean operations [PDF]
This paper presents a mesh fault-tolerant repair algorithm tailored to address common geometric issues inherent in electromagnetic models. During the actual production design phase, electromagnetic models frequently display a variety of geometric ...
Z. H. Gao +5 more
doaj +2 more sources
Fault-Tolerant Metric Dimension and Applications: Zero-Divisor Graph of Upper Triangular Matrices
Graph invariants play a crucial role in understanding the structural and combinatorial characteristics of graphs. The fault-tolerant metric dimension, as a significant graph invariant, finds applications in diverse areas such as robust network ...
Latif Abdelmalek Hanna +2 more
doaj +3 more sources
Edge-Version of Fault-Tolerant Resolvability in Networks
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 +3 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 +1 more source
Fault-Tolerant Fuzzy Resolving Domination Set
Lenka Cepova +2 more
exaly +2 more sources
Studies of Multilevel Networks via Fault-Tolerant Metric Dimensions
A subset $T$ of the vertex set of a network $G$ is called a resolving set for $G$ if each pair of vertices of $G$ have distinct representations with respect to $T$ . A resolving set $B^{\prime} $ among all the resolving sets of a network $G$
Imtiaz Ali +2 more
doaj +1 more source
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings
Let R be a commutative ring with identity. The zero-divisor graph of R denoted by is an undirected graph where is the set of non-zero zero-divisors of R and there is an edge between the vertices z1 and z2 in if A set of vertices S resolves a graph G if ...
Sahil Sharma, Vijay Kumar Bhat
doaj +1 more source

