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

by Dorota Kuziak

Published in Mathematics by MDPI AG.

2020   p1266

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)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2020-08-02
Language   en ?
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  2227-7390
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 9b3a7291-6c4a-4d4b-9496-616e8495bc42
API URL: JSON