scholarly journals An Application of Gd-Metric Spaces and Metric Dimension of Graphs

Author(s):  
Manjusha R
2019 ◽  
Vol 11 (2) ◽  
pp. 418-421
Author(s):  
B.S. Ponomarchuk

Let $(X,d)$ be a metric space. A non-empty subset $A$ of the set $X$ is called resolving set of the metric space $(X,d)$ if for two arbitrary not equal points $u,v$ from $X$ there exists an element $a$ from $A$, such that $d(u,a) \neq d(v,a)$. The smallest of cardinalities of resolving subsets of the set $X$ is called the metric dimension $md(X)$ of the metric space $(X,d)$. In general, finding the metric dimension is an NP-hard problem. In this paper, metric dimension for metric transform and wreath product of metric spaces are provided. It is shown that the metric dimension of an arbitrary metric space is equal to the metric dimension of its metric transform.


2018 ◽  
Vol 10 (01) ◽  
pp. 1850008
Author(s):  
Muhammad Imran ◽  
A. Q. Baig ◽  
Saima Rashid ◽  
Andrea Semaničová-Feňovčíková

Let [Formula: see text] be a connected graph and [Formula: see text] be the distance between the vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. The diameter of [Formula: see text] is defined as [Formula: see text] and is denoted by [Formula: see text]. A subset of vertices [Formula: see text] is called a resolving set for [Formula: see text] if for every two distinct vertices [Formula: see text], there is a vertex [Formula: see text], [Formula: see text], such that [Formula: see text]. A resolving set containing the minimum number of vertices is called a metric basis for [Formula: see text] and the number of vertices in a metric basis is its metric dimension, denoted by [Formula: see text]. Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let [Formula: see text] be a family of connected graphs [Formula: see text] depending on [Formula: see text] as follows: the order [Formula: see text] and [Formula: see text]. If there exists a constant [Formula: see text] such that [Formula: see text] for every [Formula: see text] then we shall say that [Formula: see text] has bounded metric dimension, otherwise [Formula: see text] has unbounded metric dimension. If all graphs in [Formula: see text] have the same metric dimension, then [Formula: see text] is called a family of graphs with constant metric dimension. In this paper, we study the metric properties of an infinite class of circulant graphs with three generators denoted by [Formula: see text] for any positive integer [Formula: see text] and when [Formula: see text]. We compute the diameter and determine the exact value of the metric dimension of these circulant graphs.


2019 ◽  
Vol 100 (3) ◽  
pp. 353-361 ◽  
Author(s):  
SHENG BAU ◽  
YIMING LEI

We present an example of an isometric subspace of a metric space that has a greater metric dimension. We also show that the metric spaces of vector groups over the integers, defined by the generating set of unit vectors, cannot be resolved by a finite set. Bisectors in the spaces of vector groups, defined by the generating set consisting of unit vectors, are completely determined.


Author(s):  
B Ponomarchuk

For an arbitrary metric space (X, d) subset A \subset X is called resolving if for any two points x \ne y \in X there exists point a in subset A for which following inequality holds d(a, x) \ne d(a, y). Cardinality of the subset A with the least amount of points is called metric dimension. In general, the problem of finding metric dimension of a metric space is NP–hard [1]. In this paper metric dimension for particular constructs of metric spaces is provided. In particular, it is fully characterized metric dimension for the direct sum of metric spaces and shown some properties of the metric dimension of direct product.


2013 ◽  
Vol 13 (2) ◽  
pp. 295-305 ◽  
Author(s):  
Sheng Bau ◽  
Alan F. Beardon

2018 ◽  
Vol 16 (1) ◽  
pp. 25-38 ◽  
Author(s):  
Alan F. Beardon ◽  
Juan Alberto Rodrı́guez-Velázquez

2020 ◽  
Vol 14 (1) ◽  
pp. 20-32
Author(s):  
Juan Rodríuez-Velázquez

In this article, we introduce the concept of lexicographic metric space and, after discussing some basic properties of these metric spaces, such as completeness, boundedness, compactness and separability, we obtain a formula for the metric dimension of any lexicographic metric space.


1969 ◽  
Vol 130 (1-6) ◽  
pp. 277-303 ◽  
Author(s):  
Aloysio Janner ◽  
Edgar Ascher

Sign in / Sign up

Export Citation Format

Share Document