The metric dimension of a graph is the smallest number of nodes required to identify all
other nodes uniquely based on shortest path distances. Applications of metric dimension …

The non-bijective version of Wigner's theorem states that a map which is defined on the set
of self-adjoint, rank-one projections (or pure states) of a complex Hilbert space and which …

As a generalization of the concept of the partition dimension of a graph, this article
introduces the notion of the k-partition dimension. Given a nontrivial connected graph G=(V …

The metric dimension of a general metric space was defined in 1953, applied to the set of
vertices of a graph metric in 1975, and developed further for metric spaces in 2013. It was …

Let be a metric space. A set is said to be a-metric generator for if and only if for any pair of
different points, there exist at least points such that Let be the set of metric generators for …

For a metric space (X, d), a subset A resolves (X, d) if each point x∈ X is uniquely
determined by the distances d (x, a) for a∈ A. Also the metric dimension of (X, d) is the …

Given a connected graph G=(V (G), E (G)), a set S⊆ V (G) is said to be ak-metric generator
for G if any pair of different vertices in V (G) is distinguished by at least k elements of S. A …

The Metric of a graph plays an essential role in the arrangement of different dimensional
structures and finding their basis in various terms. The metric dimension of a graph is the …

In this article, we introduce the study of corona metric space. After discussing some basic
properties of these metric spaces, such as completeness, boundedness, compactness and …

THE METRIC DIMENSION OF METRIC MANIFOLDS Page 1 Bull. Aust. Math. Soc. 91 (2015),
508–513 doi:10.1017/S0004972714001129 THE METRIC DIMENSION OF METRIC …