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

Dorota Kuziak
Additional contact information
Dorota Kuziak: Departamento de Estadística e Investigación Operativa, Universidad de Cádiz, 11003 Cádiz, Spain

Mathematics, 2020, vol. 8, issue 8, 1-14

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.

Keywords: strong resolving graph; strong metric dimension; strong resolving set; cactus graphs; unicyclic graphs (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/8/1266/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/8/1266/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:8:p:1266-:d:393459

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().