A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 ofdoi:10.3390/math8081266 fatcat:zknfnp27wjeglfpnltfxvei7xe