Results 51 to 60 of about 429,051 (306)
On the metric dimension of Cayley graphs
AKCE International Journal of Graphs and Combinatorics, 2022 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 Some Path Related Graphs
IEEE Access, 2020 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
A note on the metric and edge metric dimensions of 2-connected graphs [PDF]
Discrete Applied Mathematics, 2022 12 ...
Martin Knor +2 more
openaire +3 more sources
The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families [PDF]
, 2020 We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph.
González Yero, Ismael
core +1 more source
Relaxed spanners for directed disk graphs [PDF]
, 2010 Let $(V,\delta)$ be a finite metric space, where $V$ is a set of $n$ points and $\delta$ is a distance function defined for these points. Assume that $(V,\delta)$ has a constant doubling dimension $d$ and assume that each point $p\in V$ has a disk of ...
Peleg, David, Roditty, Liam
core +4 more sources
Application of Fractal Dimension for Quantifying Noise Texture in Computed Tomography Images [PDF]
, 2018 Purpose Evaluation of noise texture information in CT images is important for assessing image quality. Noise texture is often quantified by the noise power spectrum (NPS), which requires numerous image realizations to estimate.
Crotty, Dominic J. +4 more
core +2 more sources
On Resolvability Parameters of Some Wheel-Related Graphs
Journal of Chemistry, 2019 Let G=V,E be a simple connected graph, w∈V be a vertex, and e=uv∈E be an edge. The distance between the vertex w and edge e is given by de,w=mindw,u,dw,v, A vertex w distinguishes two edges e1, e2∈E if dw,e1≠dw,e2.
Bin Yang +3 more
doaj +1 more source
Harmonic forms on manifolds with edges [PDF]
, 2005 Let $(X,g)$ be a compact Riemannian stratified space with simple edge singularity. Thus a neighbourhood of the singular stratum is a bundle of truncated cones over a lower dimensional compact smooth manifold.
Hunsicker, Eugenie, Mazzeo, Rafe
core +2 more sources
Metric and edge-metric dimensions of bobble-neighbourhood-corona graphs
Journal of Physics: Conference Series, 2021 Abstract Resolving set in a graphG =(V(G), E(G)) is an ordered subset W of V(G) such that every vertex in V(G) has distinct representation with respect to W. Resolving set of G of minimum cardinality is called basis of G.Cardinality of basis of G is called metric dimension of G, dim(G).
null Rinurwati, R E Nabila
openaire +1 more source
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