Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of the Layer Sun Graph
Let G be a finite, connected graph of order of, at least, 2 with vertex set VG and edge set EG. A set S of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of S. The minimal doubly resolving set of vertices of graph...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/6267072 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let G be a finite, connected graph of order of, at least, 2 with vertex set VG and edge set EG. A set S of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of S. The minimal doubly resolving set of vertices of graph G is a doubly resolving set with minimum cardinality and is denoted by ψG. In this paper, first, we construct a class of graphs of order 2n+Σr=1k−2nmr, denoted by LSGn,m,k, and call these graphs as the layer Sun graphs with parameters n, m, and k. Moreover, we compute minimal doubly resolving sets and the strong metric dimension of the layer Sun graph LSGn,m,k and the line graph of the layer Sun graph LSGn,m,k. |
|---|---|
| ISSN: | 1076-2787 1099-0526 |