Results 21 to 30 of about 888,398 (240)
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
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 Infinite Graphs [PDF]
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.
Cáceres, José+4 more
openaire +8 more sources
Study of modified prism networks via fractional metric dimension
For a connected network $ \Gamma $, the distance between any two vertices is the length of the shortest path between them. A vertex $ c $ in a connected network is said to resolve an edge $ e $ if the distances of $ c $ from its endpoints are unequal ...
Ahmed Alamer +2 more
doaj +1 more source
Graphs with mixed metric dimension three and related algorithms
Let $ G = (V, E) $ be a simple connected graph. A vertex $ x\in V(G) $ resolves the elements $ u, v\in E(G)\cup V(G) $ if $ d_G(x, u)\neq d_G(x, v) $.
Dalal Awadh Alrowaili +3 more
doaj +1 more source
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 +1 more source
γ-Metrics in higher dimensions
9 pages, 1 ...
Hajibarat, Arash+2 more
openaire +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 +1 more source
Bowen's equations for upper metric mean dimension with potential [PDF]
Firstly, we introduce a new notion called induced upper metric mean dimension with potential, which naturally generalizes the definition of upper metric mean dimension with potential given by Tsukamoto to more general cases, then we establish variational principles for it in terms of upper and lower rate distortion dimensions and show there exists a ...
arxiv +1 more source