Edge version of metric dimension and doubly resolving sets of the necklace graph
type: Item
instance of: scholarly article
title: Edge version of metric dimension and doubly resolving sets of the necklace graph
zbMATH Open document ID: 1401.05097
author: Jiabao Liu
author: Zohaib Zahid
author: Ruby Nasir
author: Waqas Nazeer
published in: Mathematics
publication date: 2018-12-18T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6994846
zbMATH Keywords: necklace graph
zbMATH Keywords: resolving sets
zbMATH Keywords: edge version of metric dimension
zbMATH Keywords: edge version of doubly resolving sets
MaRDI profile type: Publication
full work available at URL: math6110243
OpenAlex ID: W2900101803
cites work: Q4075485
cites work: Q4119237
cites work: Landmarks in graphs
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: Q4198056
cites work: Base size, metric dimension and other invariants of groups and graphs
cites work: Q4464781
cites work: Q3947691
cites work: Q3144348
cites work: Q5497268
cites work: Q3649830
cites work: On a conjecture on the diameter of line graphs of graphs of diameter two
cites work: Q5412687
cites work: Distance spectra and distance energies of iterated line graphs of regular graphs
cites work: Topological indices of the line graph of subdivision graphs and their Schur-bounds
cites work: Q3144349
cites work: Uniquely identifying the edges of a graph: the edge metric dimension
cites work: On the metric dimension of line graphs
cites work: On the Metric Dimension of Cartesian Products of Graphs
cites work: Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
cites work: Minimal doubly resolving sets of prism graphs
cites work: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
cites work: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
cites work: Q3322145
cites work: On a Family of Planar Bicritical Graphs
cites work: Q4685236
Wikidata QID: Q128966771
DOI: 10.3390/MATH6110243
description: scientific article; zbMATH DE number 6994846