Results 21 to 30 of about 254,578 (267)
On Mixed Metric Dimension of Rotationally Symmetric Graphs
IEEE Access, 2020 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
Metric dimension and edge metric dimension of unicyclic graphs
, 2021 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
Vertex and edge metric dimensions of cacti
Discrete applied mathematics, 2022 In a graph G, a vertex (resp. an edge) metric generator is a set of vertices S such that any pair of vertices (resp. edges) from G is distinguished by at least one vertex from S. The cardinality of a smallest vertex (resp. edge) metric generator is the vertex (resp. edge) metric dimension of G. In [?] we determined the vertex (resp.
Jelena Sedlar, Riste Škrekovski
openaire +5 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
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
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
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
Metric and Edge Metric Dimension of Zigzag Edge Coronoid Fused with Starphene
, 2021 Let $ =(V,E)$ be a simple connected graph. $d( , )=min\{d( , w), d( , d\}$ computes the distance between a vertex $ \in V( )$ and an edge $ =wd\in E( )$. A single vertex $ $ is said to recognize (resolve) two different edges $ _{1}$ and $ _{2}$ from $E( )$ if $d( , _{2})\neq d( , _{1}\}$.
Sharma, Sunny Kumar +3 more
openaire +2 more sources
The dominant edge metric dimension of graphs
Electronic Journal of Graph Theory and Applications, 2023 Summary: For an ordered subset \(S = \{v_1, \dots, v_k\}\) of vertices in a connected graph \(G\) and an edge \(e'\) of \(G\), the edge metric \(S\)-representation of \(e'=ab\) is the vector \(r_G^e(e'|S)=(d_G(e',v_1),\dots,d_G(e',v_k))\), where \(d_G(e',v_i)=\min\{d_G(a, v_i),d_G(b,v_i)\}\). A dominant edge metric generator for \(G\) is a vertex cover
Mostafa Tavakoli +4 more
openaire +1 more source