Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of the Layer Sun Graph [PDF]
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 +6 more sources
Metric Dimension, Minimal Doubly Resolving Sets, and the Strong Metric Dimension for Jellyfish Graph and Cocktail Party Graph [PDF]
Complexity, 2020 Let Γ be a simple connected undirected graph with vertex set VΓ and edge set EΓ. The metric dimension of a graph Γ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely ...
Jia-Bao Liu, Ali Zafari, Hassan Zarei
doaj +5 more sources
Further new results on strong resolving partitions for graphs [PDF]
Open Mathematics, 2020 A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +4 more sources
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs [PDF]
Mathematics, 2020 A vertex w of a connected graph G strongly resolves two distinct vertices u,v∈V(G), if there is a shortest u,w path containing v, or a shortest v,w path containing u. A set S of vertices of G is a strong resolving set for G if every two distinct vertices
Dorota Kuziak
doaj +5 more sources
The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families [PDF]
Mathematics, 2020 We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph.
Ismael González Yero
doaj +5 more sources
A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory [PDF]
Mathematics, 2023 Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1)), (u2, σ(u2)), …(uk, σ(uk))}, |H| ≥ 2 of a fuzzy graph; then, the representation of σ − H is an ordered k-tuple with regard to H of G. If any two elements
Manimozhi Vasuki +3 more
doaj +5 more sources
Minimal doubly resolving sets and the strong metric dimension of Hamming graphs [PDF]
Applicable Analysis and Discrete Mathematics, 2012 We consider the problem of determining the cardinality ?(H2,k) of minimal doubly resolving sets of Hamming graphs H2,k. We prove that for k ? 6 every minimal resolving set of H2,k is also a doubly resolving set, and, consequently, ?(H2,k) is equal to the metric dimension of H2,k, which is known from the literature.
Milica Stojanović +2 more
exaly +5 more sources
On the strong metric dimension of the strong products of graphs [PDF]
Open Mathematics, 2015 Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u.
Kuziak Dorota +2 more
doaj +3 more sources
The general position problem and strong resolving graphs
Open Mathematics, 2019 The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj +3 more sources
Development and Validation of Cardiology-Specific Quality Indicators for Clinical Pharmacists: A Modified Delphi Study [PDF]
International Journal of General MedicineAsma M Alshahrani,1 Mohammed Ahmed Alishaq,2 Manea Fares Al Munjem,2 Abdullah Sameer Alshammari,3 Geetha Kandasamy,4 Eman Shorog4 1Department of Clinical Pharmacy, College of Pharmacy, Shaqra University, Dawadimi, Saudi Arabia; 2King Khalid Hospital ...
M Alshahrani A +5 more
doaj +2 more sources