Results 21 to 30 of about 60,505 (275)
Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks
IEEE AccessMonitoring and controlling complex networks is of great importance to understand different types of technological and physical systems for source localization.
Ruby Nasir +4 more
doaj +4 more sources
A Study of Independency on Fuzzy Resolving Sets of Labelling Graphs [PDF]
Mathematics, 2023 Considering a fuzzy graph G is simple and can be connected and considered as a subset H=u1,σu1,u2,σu2,…uk,σuk, |H|≥2; then, every two pairs of elements of σ−H have a unique depiction with the relation of H, and H can be termed as a fuzzy resolving set ...
Ramachandramoorthi Shanmugapriya +3 more
doaj +4 more sources
On the Metric Dimensions for Sets of Vertices [PDF]
Discussiones Mathematicae Graph Theory, 2023 Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, {ℓ}-resolving sets were recently introduced.
Hakanen Anni +3 more
doaj +4 more sources
Minimal Doubly Resolving Sets of Some Classes of Convex Polytopes
Journal of Mathematics, 2022 Source localization is one of the most challenging problems in complex networks. Monitoring and controlling complex networks is of great interest for understanding different types of systems, such as biological, technological, and complex physical ...
Muhammad Ahmad +4 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 +2 more sources
Resolving Sets in Temporal Graphs
A \emph{resolving set} $R$ in a graph $G$ is a set of vertices such that every vertex of $G$ is uniquely identified by its distances to the vertices of $R$. Introduced in the 1970s, this concept has been since then extensively studied from both combinatorial and algorithmic points of view. We propose a generalization of the concept of resolving sets to
Jan Bok, Antoine Dailly, Tuomo Lehtilä
core +5 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
A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon
, 2022 Personal reasons, Professor Jia Bao Liu asked us not to mention his name in the article and to thank him only in the acknowledgments ...
Zafari, Ali, Alikhani, Saeid
openaire +4 more sources
Corrections to “Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks”
IEEE AccessPresents corrections to the paper, Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks.
Ruby Nasir +4 more
doaj +2 more sources
Complexity, 2020 Let G be a finite, connected graph of order of, at least, 2 with vertex set VG and edge set EG. A set S of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of S.
Jia-Bao Liu, Ali Zafari
doaj +2 more sources