Results 31 to 40 of about 2,320,114 (270)
Edge based metric dimension of various coffee compounds.
An important dietary source of physiologically active compounds, coffee also contains phenolic acids, diterpenes, and caffeine. According to a certain study, some coffee secondary metabolites may advantageously modify a number of anti-cancer defense ...
Ali Ahmad +4 more
doaj +3 more sources
Investigating the metric and edge metric dimensions of H-naphthalenic nanotubes
If the distances between two vertices in a simple connected network are different, then a vertex x resolves the pair u and v. A set S of vertices in G is referred to as a resolving set if every pair of distinct vertices in G can be identified by at least one vertex in S.
Faryal Chaudhry +7 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
Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs
The vertex (respectively edge) metric dimension of a graph G is the size of a smallest vertex set in G, which distinguishes all pairs of vertices (respectively edges) in G, and it is denoted by dim(G) (respectively edim(G)). The upper bounds dim(G)≤2c(G)−
Martin Knor +2 more
doaj +1 more source
On the metric dimension of Cayley graphs
In this paper, we investigate the metric dimension, local metric dimension and edge metric dimension for some (generalized) Cayley graphs.
Afsaneh Rezaei +2 more
doaj +1 more source
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 +1 more source
On Mixed Metric Dimension of Some Path Related Graphs
A vertex $k\in V_{G}$ determined two elements (vertices or edges) $\ell,m \in V_{G}\cup E_{G}$ , if $d_{G}(k,\ell)\neq d_{G}(k,m)$ . A set $R_ {\text {m}}$ of vertices in a graph $G$ is a mixed metric generator for $G$ , if two distinct elements
Hassan Raza, Ying Ji, Shaojian Qu
doaj +1 more source
Metric dimension and edge metric dimension of unicyclic graphs
The metric (resp. edge metric) dimension of a simple connected graph $G$, denoted by dim$(G)$ (resp. edim$(G)$), is the cardinality of a smallest vertex subset $S\subseteq V(G)$ for which every two distinct vertices (resp. edges) in $G$ have distinct distances to a vertex of $S$.
Zhu, Enqiang +2 more
openaire +2 more sources
On the edge metric dimension and Wiener index of the blow up of graphs [PDF]
Let $G=(V,E)$ be a connected graph. The distance between an edge $e=xy$ and a vertex $v$ is defined as $\T{d}(e,v)=\T{min}\{\T{d}(x,v),\T{d}(y,v)\}.$ A nonempty set $S \subseteq V(G)$ is an edge metric generator for $G$ if for any two distinct edges ...
Afkhami, Mojgan
core +1 more source
Computing Edge Metric Dimension of One-Pentagonal Carbon Nanocone
Minimum resolving sets (edge or vertex) have become an integral part of molecular topology and combinatorial chemistry. Resolving sets for a specific network provide crucial information required for the identification of each item contained in the ...
Sunny Kumar Sharma +2 more
doaj +1 more source

