English

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 GG be a finite, connected graph of order of at least 2, with vertex set V(G)V(G) and edge set E(G)E (G). A set SS of vertices of the graph GG is a doubly resolving set for GG if every two distinct vertices of GG are doubly resolved by some two vertices of SS. The minimal doubly resolving set of vertices of graph GG is a doubly resolving set with minimum cardinality and is denoted by ψ(G)\psi(G). In this paper, first, we construct a class of graphs of order 2n+Σr=1k2nmr2n+ \Sigma_{r=1}^{k-2}nm^{r}, denoted by LSG(n,m,k)LSG(n,m, k), and call these graphs as the layer Sun graphs with parameters nn, mm and kk. Moreover, we compute minimal doubly resolving sets and the strong metric dimension of layer Sun graph LSG(n,m,k)LSG(n,m, k) and the line graph of the layer Sun graph LSG(n,m,k)LSG(n,m, k).

Keywords

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}
}