The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families [PDF]
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
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs [PDF]
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
On the strong metric dimension of the strong products of graphs
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 +5 more sources
Strong metric dimension: A survey [PDF]
The strong metric dimension has been a subject of considerable amount of research in recent years. This survey describes the related development by bringing together theoretical results and computational approaches, and places the recent results
Kratica Jozef +3 more
doaj +2 more sources
Metric Dimension, Minimal Doubly Resolving Sets, and the Strong Metric Dimension for Jellyfish Graph and Cocktail Party Graph [PDF]
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 +3 more sources
Bounded Variation Separates Weak and Strong Average Lipschitz [PDF]
We closely examine a recently introduced notion of average smoothness. The latter defined a weak and strong average-Lipschitz seminorm for real-valued functions on general metric spaces.
Ariel Elperin, Aryeh Kontorovich
doaj +2 more sources
Local Fractional Strong Metric Dimension of Certain Complex Networks
Fractional variants of distance-based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems.
Faiza Jamil +3 more
doaj +2 more sources
The dominant strong metric dimension of graphs
Graphs are useful for analyzing the structure models in computer science, operations research, and sociology. Also, different types of graph products have several applications in modeling, including those found in network analysis, communication ...
M. Valiyanpour +2 more
doaj +2 more sources
Erratum to “On the strong metric dimension of the strong products of graphs”
The original version of the article was published in Open Mathematics (formerly Central European Journal of Mathematics) 13 (2015) 64–74. Unfortunately, the original version of this article contains a mistake: in Lemma 2.17 appears that for any C1-graph ...
Kuziak Dorota +2 more
doaj +3 more sources
Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
Given a connected graph G, 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. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota +2 more
doaj +3 more sources

