Results 11 to 20 of about 238,609 (287)
Edge Metric Dimension of Some Classes of Toeplitz Networks [PDF]
Toeplitz networks are used as interconnection networks due to their smaller diameter, symmetry, simpler routing, high connectivity, and reliability.
Dalal Alrowaili +4 more
doaj +3 more sources
The K-Size Edge Metric Dimension of Graphs [PDF]
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 +3 more sources
Identifying the Exact Value of the Metric Dimension and Edge Dimension of Unicyclic Graphs [PDF]
Given a simple connected graph G, the metric dimension dim(G) (and edge metric dimension edim(G)) is defined as the cardinality of a smallest vertex subset S⊆V(G) for which every two distinct vertices (and edges) in G have distinct distances to a vertex ...
Enqiang Zhu +2 more
doaj +6 more sources
Edge metric dimension of $k$ multiwheel graph
If we consider G=(V,E) to be a connected graph, with v∈V and e=uw∈E, then dG(e,v)= min{dG(u,v),dG(w,v)} has been defined as the distance between a vertex v and an edge e.
Zahid Raza
exaly +4 more sources
Bi-Edge Metric Dimension of Graphs [PDF]
Given a connected G = (V(G),E(G)) graph. The main problem in graph metric dimensions is calculating the metric dimensions and their characterization.
Rinurwati Rinurwati +1 more
semanticscholar +4 more sources
Metric dimension and edge metric dimension of windmill graphs
Graph invariants provide an amazing tool to analyze the abstract structures of graphs. Metric dimension and edge metric dimension as graph invariants have numerous applications, among them are robot navigation, pharmaceutical chemistry, etc.
Pradeep Singh +3 more
semanticscholar +4 more sources
Graphs with the edge metric dimension smaller than the metric dimension [PDF]
Given a connected graph $G$, the metric (resp. edge metric) dimension of $G$ is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (resp.
M. Knor +4 more
semanticscholar +4 more sources
A note on the metric and edge metric dimensions of 2-connected graphs [PDF]
12 ...
Martin Knor +2 more
openaire +6 more sources
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
A molecular (chemical) graph is a simple connected graph, where the vertices represent the compound’s atoms and the edges represent bonds between the atoms, and the degree (valence) of every vertex (atom) is not more than four.
Karnika Sharma +2 more
doaj +2 more sources
Uniquely identifying the edges of a graph: The edge metric dimension [PDF]
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)$.
Ismael G Yero, Niko Tratnik
exaly +3 more sources

