Results 11 to 20 of about 1,431,476 (287)
Metric dimension of fullerene graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2019 A resolving set W is a set of vertices of a graph G(V, E) such that for every pair of distinct vertices u, v ∈ V(G), there exists a vertex w ∈ W satisfying d(u, w) ≠ d(v, w).
Shehnaz Akhter, Rashid Farooq
doaj +3 more sources
Mixed metric dimension of graphs [PDF]
Applied Mathematics and Computation, 2017 arXiv admin note: text overlap with arXiv:1602 ...
Dorota Kuziak +2 more
exaly +7 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure [PDF]
PLoS ONE, 2023 The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin +4 more
doaj +4 more sources
Optimizing emergency response services in urban areas through the fault-tolerant metric dimension of hexagonal nanosheet [PDF]
Scientific ReportsIn this work, we find the fault-tolerant metric dimension of a hexagonal nanosheet. This concept ensures robust identity of vertices inside a graph, even in situations in which a few resolving vertices fail.
Yaoyao Tu +5 more
doaj +2 more sources
The Metric Dimension and Local Metric Dimension of Relative Prime Graph [PDF]
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2020 This study aims to determine the value of metric dimensions and local metric dimensions of relative prime graphs formed from modulo integer rings, namely . As a vertex set is and if and are relatively prime.
Inna Kuswandari +2 more
doaj +2 more sources
On the Metric Dimension of Infinite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree.
José Cáceres +4 more
core +9 more sources
Graphs with the edge metric dimension smaller than the metric dimension [PDF]
Applied Mathematics and Computation, 2021 11 ...
Riste Škrekovski +2 more
exaly +4 more sources
Metric Dimension Threshold of Graphs
Journal of Mathematics, 2022 Let G be a connected graph. A subset S of vertices of G is said to be a resolving set of G, if for any two vertices u and v of G there is at least a member w of S such that du,w≠dv,w.
Meysam Korivand +2 more
doaj +2 more sources
The dominant metric dimension of graphs [PDF]
Heliyon, 2020 The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u.
Liliek Susilowati +4 more
doaj +2 more sources
Metric Mean Dimension and Mean Hausdorff Dimension Varying the Metric [PDF]
Qualitative Theory of Dynamical SystemsAbstractLet $$f:\mathbb {M}\rightarrow \mathbb {M}$$ f : M → M be a continuous map on a compact metric space $$\mathbb {M}$$ M equipped with a fixed metric d, and ...
Becker, Alex Jenaro +3 more
core +6 more sources