Results 11 to 20 of about 693,652 (267)
Metric dimension of Andrásfai graphs [PDF]
A set \(W\subseteq V(G)\) is called a resolving set, if for each pair of distinct vertices \(u,v\in V(G)\) there exists \(t\in W\) such that \(d(u,t)\neq d(v,t)\), where \(d(x,y)\) is the distance between vertices \(x\) and \(y\).
S. Batool Pejman +2 more
doaj +4 more sources
On Metric Dimension of Functigraphs [PDF]
The \emph{metric dimension} of a graph $G$, denoted by $\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices.
Bailey R. F. +17 more
core +2 more sources
The Metric Dimension and Local Metric Dimension of Relative Prime Graph [PDF]
This study aims to determine the value of metric dimensions and local metric dimensions of relative prime graphs formed from modulo integer rings, namely . As a vertex set is and if and are relatively prime.
Inna Kuswandari +2 more
doaj +2 more sources
Graphs with the edge metric dimension smaller than the metric dimension [PDF]
11 ...
Knor, Martin +4 more
exaly +5 more sources
Metric Dimension Parameterized By Treewidth [PDF]
AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer.
Bonnet, Edouard, Purohit, Nidhi
openaire +7 more sources
Sequential Metric Dimension [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien +4 more
openaire +5 more sources
γ-Metrics in higher dimensions
9 pages, 1 ...
Hajibarat, Arash +2 more
openaire +2 more sources
Metric dimension and edge metric dimension of windmill graphs
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
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
Let Γ = (V, E) be a connected graph. A vertex i ∈ V recognizes two elements (vertices or edges) j, k ∈ E ∩ V, if dΓ(i, j) ≠ dΓ(i, k). A set S of vertices in a connected graph Γ is a mixed metric generator for Γ if every two distinct elements (vertices or
Hassan Raza, Ying Ji
doaj +1 more source
Metric Dimension Threshold of Graphs
Let G be a connected graph. A subset S of vertices of G is said to be a resolving set of G, if for any two vertices u and v of G there is at least a member w of S such that du,w≠dv,w.
Meysam Korivand +2 more
doaj +1 more source

