Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3390/math6110243 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2900101803 / rank | |||
Normal rank | |||
Revision as of 21:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge version of metric dimension and doubly resolving sets of the necklace graph |
scientific article |
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
