Results 41 to 50 of about 691,381 (299)
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
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
On the k-metric dimension of metric spaces
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 then generalised in 2015 to the k-metric dimension of a graph for each positive integer k, where k=1 corresponds to the original definition.
Beardon, Alan F. +1 more
openaire +5 more sources
Intrinsic Dimension Estimation for Discrete Metrics
Real world-datasets characterized by discrete features are ubiquitous: from categorical surveys to clinical questionnaires, from unweighted networks to DNA sequences. Nevertheless, the most common unsupervised dimensional reduction methods are designed for continuous spaces, and their use for discrete spaces can lead to errors and biases.
Macocco, Iuri +3 more
openaire +3 more sources
Metric based resolvability of cycle related graphs
If a subset of vertices of a graph, designed in such a way that the remaining vertices have unique identification (usually called representations) with respect to the selected subset, then this subset is named as a metric basis (or resolving set).
Ali N. A. Koam
doaj +1 more source
The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs
Let ${\mathcal G}$ be a graph family defined on a common (labeled) vertex set $V$. A set $S\subseteq V$ is said to be a simultaneous metric generator for ${\cal G}$ if for every $G\in {\cal G}$ and every pair of different vertices $u,v\in V$ there exists
Estrada-Moreno, Alejandro +2 more
core +1 more source
Metric Characterizations of Dimension for Separable Metric Spaces [PDF]
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)\} .
Janos, Ludvik, Martin, Harold W.
openaire +1 more source
Computing dominant metric dimensions of certain connected networks
In the studies of the connected networks, metric dimension being a distance-based parameter got much more attention of the researches due to its wide range of applications in different areas of chemistry and computer science. At present its various types
Imtiaz Ali, Muhammad Javaid, Yilun Shang
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
Psychosocial Outcomes in Patients With Endocrine Tumor Syndromes: A Systematic Review
ABSTRACT Introduction The combination of disease manifestations, the familial burden, and varying penetrance of endocrine tumor syndromes (ETSs) is unique. This review aimed to portray and summarize available data on psychosocial outcomes in patients with ETSs and explore gaps and opportunities for future research and care.
Daniël Zwerus +6 more
wiley +1 more source

