Results 1 to 10 of about 92,183 (289)
The dominant metric dimension of graphs [PDF]
The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u.
Liliek Susilowati +4 more
doaj +4 more sources
Mixed metric dimension of graphs [PDF]
arXiv admin note: text overlap with arXiv:1602 ...
Dorota Kuziak +2 more
exaly +6 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure [PDF]
The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin +4 more
doaj +4 more sources
The metric dimension of Cayley digraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shonda Gosselin, Ortrud R Oellermann
exaly +4 more sources
Graphs with the edge metric dimension smaller than the metric dimension [PDF]
11 ...
Martin Knor +2 more
exaly +4 more sources
Optimizing emergency response services in urban areas through the fault-tolerant metric dimension of hexagonal nanosheet [PDF]
In this work, we find the fault-tolerant metric dimension of a hexagonal nanosheet. This concept ensures robust identity of vertices inside a graph, even in situations in which a few resolving vertices fail.
Yaoyao Tu +5 more
doaj +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
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications [PDF]
Resolvability parameters of graphs are widely applicable in fields like computer science, chemistry, and geography. Many of these parameters, such as the metric dimension, are computationally hard to determine. This paper focuses on Möbius-type geometric
Sakander Hayat +6 more
doaj +2 more sources
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
Metric dimension of star fan graph [PDF]
Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set.
S. Prabhu +2 more
doaj +2 more sources

