Results 51 to 60 of about 4,331 (257)
Theoretical Computer Science, 2020 Abstract Resolving sets are designed to locate an object in a network by measuring the distances to the object. However, if there are more than one object present in the network, this can lead to wrong conclusions. To overcome this problem, we introduce the concept of solid-resolving sets.
Anni Hakanen +2 more
openaire +2 more sources
On the metric dimensions for sets of vertices
Discussiones Mathematicae Graph Theory, 2020 21 pages, 5 ...
Hakanen, Anni +3 more
openaire +5 more sources
On Adjacency Metric Dimension of Some Families of Graph
Journal of Function Spaces, 2022 Metric dimension of a graph is a well-studied concept. Recently, adjacency metric dimension of graph has been introduced. A set Qa⊂VG is considered to be an adjacency metric generator for G if u1,u2∈V\Qa (supposing each pair); there must exist a vertex q∈
Ali N. A. Koam +4 more
doaj +1 more source
Mixed metric dimension of graphs [PDF]
Applied Mathematics and Computation, 2017 arXiv admin note: text overlap with arXiv:1602 ...
Aleksander Kelenc +3 more
openaire +4 more sources
Metric dimension of metric transform and wreath product
Karpatsʹkì Matematičnì Publìkacìï, 2019 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
Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid
Mathematics, 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
Metric Dimension for Random Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 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)$.
Béla Bollobás +2 more
openaire +4 more sources
Metric Dimensions of Bicyclic Graphs
Mathematics, 2023 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 +4 more sources
GRAF DUAL ANTIPRISMA DAN DIMENSI METRIKNYA
E-Jurnal Matematika, 2021 Dual graph is one form of graph that can only be formed from graphs whose edges do not intersect each other. One of the graphs that can be converted into dual graphs is the antiprism graph Amn .
FENNY FITRIANI, SARI CAHYANINGTIAS
doaj +1 more source
Metric based resolvability of cycle related graphs
AIMS MathematicsIf 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