Results 11 to 20 of about 718 (221)
Fault-tolerance in metric dimension of boron nanotubes lattices
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 +3 more sources
Computing Fault-Tolerant Metric Dimension of Connected Graphs
Journal of Mathematics, 2022 For a connected graph, the concept of metric dimension contributes an important role in computer networking and in the formation of chemical structures.
Uzma Ahmad +3 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 +3 more sources
Studies of Multilevel Networks via Fault-Tolerant Metric Dimensions
IEEE Access, 2022 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 +2 more sources
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 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 +2 more sources
FAULT-TOLERANT METRIC DIMENSION OF ANNIHILATOR GRAPHS OF COMMUTATIVE RINGS [PDF]
Journal of Algebraic SystemsLet R be a commutative ring with identity. The annihilator graph AG (R) is a simple graph with vertex set as the set of all non-zero zero-divisors of R, and two distinct vertices a and b are adjacent if and only if annR (a) ∪ annR (b) ̸= annR (a · b). We
Mohan S. Akhila, Karunakaran Manilal
doaj +3 more sources
Investigating the Metric and Fault-Tolerant Dimensions in Para-Line Network Topologies
AKCE International Journal of Graphs and CombinatoricsThe 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 +3 more sources
Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings
AxiomsIn 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
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 +1 more source
FAULT-TOLERANT METRIC DIMENSION OF CIRCULANT GRAPHS [PDF]
Facta Universitatis, Series: Mathematics and Informatics, 2019 A set $W$ of vertices in a graph $G$ is called a resolving setfor $G$ if for every pair of distinct vertices $u$ and $v$ of $G$ there exists a vertex $w \in W$ such that the distance between $u$ and $w$ is different from the distance between $v$ and $w$. The cardinality of a minimum resolving set is called the metric dimension of $G$, denoted by $\beta(
Seyedi, Narjes, Maimani, Hamid Reza
openaire +1 more source