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 +7 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 +4 more sources
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 +5 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 +5 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 +5 more sources
Strong Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2023 A vertex w in a connected graph G strongly resolves two distinct vertices u and v in V (G) if v is in any shortest u-w path or if u is in any shortest v-w path.
Jerson Mohamad, Helen M. Rara
semanticscholar +2 more sources
On Movable Strong Resolving Domination in Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. A strong resolving dominating set S is a 1-movable strong resolving dominating set of G if for every v ∈ S, either S \ {v} is a strong resolving dominating set or there exists a vertex u ∈ (V (G) \ S) ∩ NG(v) such that (S \ {v}
Helyn Cosinas Sumaoy, Helen M. Rara
semanticscholar +2 more sources
Strong Resolving Domination in the Lexicographic Product of Graphs
European Journal of Pure and Applied Mathematics, 2023 Let G be a connected graph. A subset S ⊆ V (G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v ∈ V (G), there exists a vertex w ∈ S such that u ∈ IG[v, w] or IG[u, w].
Gerald B. Monsanto +2 more
semanticscholar +2 more sources
A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory
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 +2 more sources