Results 31 to 40 of about 693,652 (267)
Spread: a measure of the size of metric spaces [PDF]
Motivated by Leinster-Cobbold measures of biodiversity, the notion of the spread of a finite metric space is introduced. This is related to Leinster's magnitude of a metric space.
Willerton, Simon
core +1 more source
Nonlocal Metric Dimension of Graphs
Nonlocal metric dimension ${\rm dim}_{\rm n\ell}(G)$ of a graph $G$ is introduced as the cardinality of a smallest nonlocal resolving set, that is, a set of vertices which resolves each pair of non-adjacent vertices of $G$. Graphs $G$ with ${\rm dim}_{\rm n\ell}(G) = 1$ or with ${\rm dim}_{\rm n\ell}(G) = n(G)-2$ are characterized.
Sandi Klavžar, Dorota Kuziak
openaire +3 more sources
On Constant Metric Dimension of Some Generalized Convex Polytopes
Metric dimension is the extraction of the affine dimension (obtained from Euclidean space Ed) to the arbitrary metric space. A family ℱ=Gn of connected graphs with n≥3 is a family of constant metric dimension if dimG=k (some constant) for all graphs in ...
Xuewu Zuo +5 more
doaj +1 more source
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete ...
Nurma Ariska Sutardji +2 more
doaj +1 more source
Metric Dimensions of Bicyclic Graphs
The distance d(va,vb) between two vertices of a simple connected graph G is the length of the shortest path between va and vb. Vertices va,vb of G are considered to be resolved by a vertex v if d(va,v)≠d(vb,v). An ordered set W={v1,v2,v3,…,vs}⊆V(G) is said to be a resolving set for G, if for any va,vb∈V(G),∃vi∈W∋d(va,vi)≠d(vb,vi). The representation of
Asad Khan +5 more
openaire +2 more sources
Metric dimension of metric transform and wreath product
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)$.
B.S. Ponomarchuk
doaj +1 more source
Fault-Tolerant Metric Dimension of Circulant Graphs
Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha +4 more
doaj +1 more source
Metric Dimension for Random Graphs [PDF]
The metric dimension of a graph $G$ is the minimum number of vertices in a subset $S$ of the vertex set of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $S$. In this paper we investigate the metric dimension of the random graph $G(n,p)$ for a wide range of probabilities $p=p(n)$.
Bollobás, Béla +2 more
openaire +4 more sources
A study on Quantization Dimension in complete metric spaces [PDF]
The primary objective of the present paper is to develop the theory of quantization dimension of an invariant measure associated with an iterated function system consisting of finite number of contractive infinitesimal similitudes in a complete metric ...
Roychowdhury, Mrinal K., Verma, S.
core +2 more sources
Axisymmetric metrics in arbitrary dimensions [PDF]
We consider axially symmetric static metrics in arbitrary dimension, both with and without a cosmological constant. The most obvious such solutions have an SO(n) group of Killing vectors representing the axial symmetry, although one can also consider abelian groups which represent a flat `internal space'.
Charmousis, Christos, Gregory, Ruth
openaire +3 more sources

