Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6994846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge version of metric dimension and doubly resolving sets of the necklace graph |
scientific article; zbMATH DE number 6994846 |
Statements
Edge version of metric dimension and doubly resolving sets of the necklace graph (English)
0 references
18 December 2018
0 references
Summary: Consider an undirected and connected graph \(G = (V_G, E_G)\), where \(V_G\) and \(E_G\) represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges in a graph. In this paper, we find the edge version of metric dimension and doubly resolving sets for the necklace graph.
0 references
necklace graph
0 references
resolving sets
0 references
edge version of metric dimension
0 references
edge version of doubly resolving sets
0 references
0.8034913539886475
0 references
0.79746413230896
0 references
0.774405300617218
0 references
0.7660108208656311
0 references
0.7640708088874817
0 references
