Results 11 to 20 of about 654,066 (314)
On Metric Dimension of Functigraphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2012 The \emph{metric dimension} of a graph $G$, denoted by $\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices.
Bailey R. F. +17 more
core +4 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
Metric dimension of Andrásfai graphs [PDF]
Opuscula Mathematica, 2019 A set \(W\subseteq V(G)\) is called a resolving set, if for each pair of distinct vertices \(u,v\in V(G)\) there exists \(t\in W\) such that \(d(u,t)\neq d(v,t)\), where \(d(x,y)\) is the distance between vertices \(x\) and \(y\).
S. Batool Pejman +2 more
doaj +4 more sources
Metric dimension and equivalent metrics [PDF]
Fundamenta Mathematicae, 1968 J. H. Roberts, F. Slaughert
openalex +3 more sources
Metric-Dependent Dimension Functions [PDF]
Proceedings of the American Mathematical Society, 1965 Kei� Nagami, J. H. Roberts
+5 more sources
Metric characterizations of dimension for separable metric spaces [PDF]
Proceedings of the American Mathematical Society, 1978 A subset B of a metric space (X, d) is called a d-bisector set iff there are distinct points x and y in X with B = { z : d ( x , z ) = d ( y , z ) } B = \{ z:d(x,z) = d(y,z)\} .
Ludvík Janoš, Harold W. Martin
openalex +2 more sources
On metric dimensions of hypercubes
Ars Mathematica Contemporanea, 2022 The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by using a vector of distances to this set. In this note we show two unexpected results on hypercube graphs. First, we
Kelenc, Aleksander +3 more
openaire +5 more sources
Graphs with the edge metric dimension smaller than the metric dimension [PDF]
Applied Mathematics and Computation, 2021 11 ...
Martin Knor +4 more
openaire +3 more sources
Metric Dimension Parameterized By Treewidth [PDF]
Algorithmica, 2021 AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer.
Édouard Bonnet +2 more
openaire +7 more sources