Results 21 to 30 of about 84,964 (255)
γ-Metrics in higher dimensions
Nuclear Physics B, 2022 9 pages, 1 ...
Hajibarat, Arash +2 more
openaire +2 more sources
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
Frontiers in Physics, 2020 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
Theoretical Computer Science, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anni Hakanen +2 more
openaire +1 more source
On the Complexity of Metric Dimension [PDF]
, 2012 The metric dimension of a graph G is the size of a smallest subset L ⊆ V(G) such that for any x,y ∈ V(G) there is a z ∈ L such that the graph distance between x and z differs from the graph distance between y and z. Even though this notion has been part of the literature for almost 40 years, the computational complexity of determining the metric ...
Josep Díaz +3 more
openaire +3 more sources
On the Metric Dimension of Infinite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree.
José Cáceres +4 more
openaire +5 more sources
Metric Dimension Threshold of Graphs
Journal of Mathematics, 2022 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
Study of Convexo-Symmetric Networks via Fractional Dimensions
IEEE Access, 2022 For having an in-depth study and analysis of various network’s structural properties such as interconnection, extensibility, availability, centralization, vulnerability and reliability, we require distance based graph theoretic parameters ...
Muhammad Kamran Aslam +3 more
doaj +1 more source
Strong metric dimension: A survey [PDF]
Yugoslav Journal of Operations Research, 2014 The strong metric dimension has been a subject of considerable amount of research in recent years. This survey describes the related development by bringing together theoretical results and computational approaches, and places the recent results
Kratica Jozef +3 more
doaj +1 more source
Contemporary Mathematics and Applications (ConMathA), 2020 Adjacency metric dimension and local adjacency metric dimension are the development of metric dimension. The purpose of this research is to determine the adjacency metric dimension of corona graph between any connected graph G and non-trivial graph H ...
Virdina Rahmayanti +2 more
doaj +1 more source