Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph

Jia-Bao Liu, Zohaib Zahid, Ruby Nasir and Waqas Nazeer
Additional contact information
Jia-Bao Liu: School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
Zohaib Zahid: Department of Mathematics, University of Management and Technology, Lahore 54000, Pakistan
Ruby Nasir: Department of Mathematics, University of Management and Technology, Lahore 54000, Pakistan
Waqas Nazeer: Division of Science and Technology, University of Education, Lahore 54000, Pakistan

Mathematics, 2018, vol. 6, issue 11, 1-10

Abstract: 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.

Keywords: necklace graph; resolving sets; edge version of metric dimension; edge version of doubly resolving sets (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/6/11/243/pdf (application/pdf)
https://www.mdpi.com/2227-7390/6/11/243/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:6:y:2018:i:11:p:243-:d:181279

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().