Results 41 to 50 of about 680,163 (298)
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
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
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
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs
Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is
Reni Umilasari +3 more
doaj +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
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
The metric dimension and metric independence of a graph [PDF]
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core
In the aircraft sector, honeycomb composite materials are frequently employed. Recent research has demonstrated the benefits of honeycomb structures in applications involving nanohole arrays in anodized alumina, micro-porous arrays in polymer thin films,
Sidra Bukhari +3 more
doaj +1 more source

