Results 51 to 60 of about 253,596 (293)
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
Edge metric dimension of $k$ multiwheel graph
Rocky Mountain Journal of Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bataineh, Mohammad S. +2 more
openaire +2 more sources
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
The K-Size Edge Metric Dimension of Graphs
Journal of Mathematics, 2020 In this paper, a new concept k-size edge resolving set for a connected graph G in the context of resolvability of graphs is defined. Some properties and realizable results on k-size edge resolvability of graphs are studied.
Tanveer Iqbal +2 more
doaj +1 more source
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
Uniquely identifying the edges of a graph: The edge metric dimension [PDF]
Discrete Applied Mathematics, 2018 Let $G=(V,E)$ be a connected graph, let $v\in V$ be a vertex and let $e=uw\in E$ be an edge. The distance between the vertex $v$ and the edge $e$ is given by $d_G(e,v)=\min\{d_G(u,v),d_G(w,v)\}$. A vertex $w\in V$ distinguishes two edges $e_1,e_2\in E$ if $d_G(w,e_1)\ne d_G(w,e_2)$.
Aleksander Kelenc +2 more
openaire +2 more sources
Patched Network and Its Vertex-Edge Metric-Based Dimension
IEEE Access, 2023 The p-type networks are designed with the help of CVNET at topo group Cluj and also given support by nano studio. Such networks develop new p-type surfaces and also represent the decorations of the surfaces.
Sidra Bukhari +3 more
doaj +1 more source
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
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
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