Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of Layer Sun Graph
Combinatorics
2020-09-21 v3
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 layer Sun graph and the line graph of the layer Sun graph .
Cite
@article{arxiv.2006.00858,
title = {Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of Layer Sun Graph},
author = {Jia-Bao Liu and Ali Zafari},
journal= {arXiv preprint arXiv:2006.00858},
year = {2020}
}