Results 31 to 40 of about 254,578 (267)
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
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
Edge Metric Dimension of Some Classes of Toeplitz Networks
Journal of Mathematics, 2021 Toeplitz networks are used as interconnection networks due to their smaller diameter, symmetry, simpler routing, high connectivity, and reliability.
Dalal Alrowaili +4 more
doaj +1 more source
The local edge metric dimension of graph
Journal of Physics: Conference Series, 2020 Abstract In this paper, we introduce a new notion of graph theory study, namely a local edge metric dimension. It is a natural extension of metric dimension concept. dG (e,v) = min{d(x,v),d(y,v)} is the distance between the vertex v and the edge xy in graph G. A non empty set
R Adawiyah +5 more
openaire +1 more source
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
A Comparative Study of Three Resolving Parameters of Graphs
Complexity, 2021 Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures,
Hafiz Muhammad Ikhlaq +2 more
doaj +1 more source
Computation of Edge Resolvability of Benzenoid Tripod Structure
Journal of Mathematics, 2021 In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively.
Ali Ahmad +4 more
doaj +1 more source
On the edge metric dimension of graphs
AIMS Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meiqin Wei, Jun Yue, Xiaoyu zhu
openaire +3 more sources
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