Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of the Layer Sun Graph

Jia-Bao Liu and Ali Zafari

Complexity, 2020, vol. 2020, 1-8

Abstract:

Let be a finite, connected graph of order of, at least, 2 with vertex set and edge set . A set of vertices of the graph is a doubly resolving set for if every two distinct vertices of are doubly resolved by some two vertices of . The minimal doubly resolving set of vertices of graph is a doubly resolving set with minimum cardinality and is denoted by . In this paper, first, we construct a class of graphs of order , denoted by , and call these graphs as the layer Sun graphs with parameters , , and . Moreover, we compute minimal doubly resolving sets and the strong metric dimension of the layer Sun graph and the line graph of the layer Sun graph .

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/6267072.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/6267072.xml (text/xml)

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:hin:complx:6267072

DOI: 10.1155/2020/6267072

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().