Results 41 to 50 of about 1,385,922 (245)
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
Hyperconvexity and endpoints in T₀-quasi-metric spaces [PDF]
Over the last decades much progress has been made in the investigation of hyperconvexity in metric spaces. Recently Kemajou and others have published an article concerning hyperconvexity in T₀-quasi-metric spaces.
Haihambo, Paulus
core +1 more source
Metric dimension and edge metric dimension of unicyclic graphs
The metric (resp. edge metric) dimension of a simple connected graph $G$, denoted by dim$(G)$ (resp. edim$(G)$), is the cardinality of a smallest vertex subset $S\subseteq V(G)$ for which every two distinct vertices (resp. edges) in $G$ have distinct distances to a vertex of $S$.
Zhu, Enqiang +2 more
openaire +2 more sources
The metric dimension of a compact metric space is defined here as the order of growth of the exponential metric entropy of the space. The metric dimension depends on the metric, but is always bounded below by the topological dimension. Moreover, there is
Reese T. Prosser
core +1 more source
Mixed triple metric dimension (MTMD) is a new resolvability parameter that extends metric, edge, and mixed metric dimension by distinguishing vertices, edges, and faces simultaneously within a single framework for plane graphs. To examine the theoretical
Robiatul Adawiyah +2 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
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
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
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
Nonlocal metric dimension of graphs [PDF]
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$.
Klavžar, Sandi +3 more
core +1 more source

