Results 1 to 10 of about 4,697,440 (322)
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
exaly +4 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.
Pradeep Singh+3 more
doaj +2 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
Metric and Fault-Tolerant Metric Dimension of Hollow Coronoid
Coronoid systems actually arrangements of hexagons into six sides of benzenoids. By nature, it is an organic chemical structure. Hollow coronoids are primitive and catacondensed coronoids. It is also known as polycyclic conjugated hydrocarbons.
Ali N. A. Koam+3 more
doaj +2 more sources
Metric basis and metric dimension of 1-pentagonal carbon nanocone networks. [PDF]
Resolving set and metric basis has become an integral part in combinatorial chemistry and molecular topology. It has a lot of applications in computer, chemistry, pharmacy and mathematical disciplines.
Hussain Z+5 more
europepmc +2 more sources
On Mixed Metric Dimension of Rotationally Symmetric Graphs
A vertex u ∈ V(G) resolves (distinguish or recognize) two elements (vertices or edges) v, w ∈ E(G)UV(G) if dG(u, v) ≠ dG(u, w) . A subset Lm of vertices in a connected graph G is called a mixed metric generator for G if every two ...
Hassan Raza, Jia-Bao Liu, Shaojian Qu
doaj +2 more sources
Fault-Tolerant Metric Dimension of Circulant Graphs
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 +2 more sources
Bounds of Fractional Metric Dimension and Applications with Grid-Related Networks
Metric dimension of networks is a distance based parameter that is used to rectify the distance related problems in robotics, navigation and chemical strata. The fractional metric dimension is the latest developed weighted version of metric dimension and
Ali H. Alkhaldi+3 more
doaj +2 more sources
Graphs with the edge metric dimension smaller than the metric dimension [PDF]
Given a connected graph $G$, the metric (resp. edge metric) dimension of $G$ is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (resp. edges) of $G$ by means of distance vectors to such a set. In this work, we settle three open problems on (edge) metric dimension of graphs.
M. Knor+4 more
arxiv +3 more sources
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 +2 more sources