On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks
Complexity, 2021 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
Hua Wang +4 more
doaj +2 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure. [PDF]
PLoS ONE, 2023 The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin +4 more
doaj +2 more sources
Optimal Fault-Tolerant Resolving Set of Power Paths
Mathematics, 2023 In a simple connected undirected graph G, an ordered set R of vertices is called a resolving set if for every pair of distinct vertices u and v, there is a vertex w∈R such that d(u,w)≠d(v,w).
Laxman Saha +4 more
doaj +2 more sources
Optimal Multi-Level Fault-Tolerant Resolving Sets of Circulant Graph C(n : 1, 2)
Mathematics, 2023 Let G=(V(G),E(G)) be a simple connected unweighted graph. A set R⊂V(G) is called a fault-tolerant resolving set with the tolerance level k if the cardinality of the set Sx,y={w∈R:d(w,x)≠d(w,y)} is at least k for every pair of distinct vertices x,y of G ...
Laxman Saha +4 more
doaj +2 more sources
Fault-tolerance in metric dimension of boron nanotubes lattices [PDF]
Frontiers in Computational Neuroscience, 2023 The concept of resolving set and metric basis has been very successful because of multi-purpose applications both in computer and mathematical sciences.
Zafar Hussain, Muhammad Mobeen Munir
doaj +2 more sources
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 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]
Scientific ReportsIn 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
Robust mesh generation for electromagnetic models with geometric defects through node alignment and mesh boolean operations [PDF]
Scientific ReportsThis 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
All metric bases and fault-tolerant metric dimension for square of grid [PDF]
Opuscula Mathematica, 2022 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 Metric Dimension of Circulant Graphs
Mathematics, 2022 Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha +4 more
doaj +1 more source