The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs

Dorota Kuziak
2020 Mathematics  
A vertex w of a connected graph G strongly resolves two distinct vertices u,v∈V(G), if there is a shortest u,w path containing v, or a shortest v,w path containing u. A set S of vertices of G is a strong resolving set for G if every two distinct vertices of G are strongly resolved by a vertex of S. The smallest cardinality of a strong resolving set for G is called the strong metric dimension of G. To study the strong metric dimension of graphs, a very important role is played by a structure of
more » ... raphs called the strong resolving graph In this work, we obtain the strong metric dimension of some families of cactus graphs, and along the way, we give several structural properties of the strong resolving graphs of the studied families of cactus graphs.
doi:10.3390/math8081266 fatcat:zknfnp27wjeglfpnltfxvei7xe