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: | Jia-Bao Liu, Ali Zafari |
---|---|
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!
|
Similar Items
-
Metric Dimension Threshold of Graphs
by: Meysam Korivand, et al.
Published: (2022-01-01) -
Maximal resolving sets in a graph
by: V. Swaminathan, et al.
Published: (2024-12-01) -
Computing Fault-Tolerant Metric Dimension of Connected Graphs
by: Uzma Ahmad, et al.
Published: (2022-01-01) -
The Metric Dimension of Some Generalized Petersen Graphs
by: Zehui Shao, et al.
Published: (2018-01-01) -
Classes of Planar Graphs with Constant Edge Metric Dimension
by: Changcheng Wei, et al.
Published: (2021-01-01)