Results 41 to 50 of about 92,183 (289)

Metric dimension and edge metric dimension of windmill graphs

open access: yesAIMS Mathematics, 2021
Graph invariants provide an amazing tool to analyze the abstract structures of graphs. Metric dimension and edge metric dimension as graph invariants have numerous applications, among them are robot navigation, pharmaceutical chemistry, etc. In this article, we compute the metric and edge metric dimension of two classes of windmill graphs such as ...
Pradeep Singh   +3 more
openaire   +3 more sources

Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid

open access: yesMathematics, 2021
Geometric arrangements of hexagons into six sides of benzenoids are known as coronoid systems. They are organic chemical structures by definition. Hollow coronoids are divided into two types: primitive and catacondensed coronoids.
Ali N. A. Koam   +3 more
doaj   +1 more source

On the metric dimension of HDN

open access: yesJournal of Discrete Algorithms, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dacheng Xu, Jianxi Fan
openaire   +1 more source

The local metric dimension of a graph [PDF]

open access: yes, 2010
summary:For an ordered set $W= \{w_1,w_2,\ldots ,w_k\}$ of $k$ distinct vertices in a nontrivial connected graph $G$, the metric code of a vertex $v$ of $G$ with respect to $W$ is the $k$-vector \[ \mathop {\rm code}(v)= ( d(v,w_1),d(v,w_2),\cdots ,d(v ...
Okamoto, Futaba   +2 more
core   +1 more source

On Constant Metric Dimension of Some Generalized Convex Polytopes

open access: yesJournal of Mathematics, 2021
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

Nonlocal metric dimension of graphs

open access: yes, 2022
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, Kuziak, Dorota
core   +1 more source

On a Metric that Characterizes Dimension [PDF]

open access: yesCanadian Journal of Mathematics, 1957
Sometimes it is possible to characterize topological properties of a metrizable space M by claiming that a certain (topologypreserving) metric ρ can be introduced in M.
openaire   +2 more sources

On the metric dimensions for sets of vertices

open access: yesDiscussiones Mathematicae Graph Theory, 2020
21 pages, 5 ...
Anni Hakanen   +3 more
openaire   +5 more sources

Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian

open access: yesContemporary Mathematics and Applications (ConMathA), 2020
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

open access: yesMathematics, 2022
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

Home - About - Disclaimer - Privacy