The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
release_zknfnp27wjeglfpnltfxvei7xe
Abstract
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 graphs 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.
In application/xml+jats
format
Archived Files and Locations
application/pdf 288.8 kB
file_im4nrejuz5bh3grpmxihmwxxqi
|
res.mdpi.com (publisher) web.archive.org (webarchive) |
Web Captures
https://www.mdpi.com/2227-7390/8/8/1266/htm
2022-02-05 04:30:50 | 43 resources webcapture_tncm6dohzjhp5elfpp4mm47l54
|
web.archive.org (webarchive) |
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:
2227-7390
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar