The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
About this item
Full title
Author / Creator
Publisher
Basel: MDPI AG
Journal title
Language
English
Formats
Publication information
Publisher
Basel: MDPI AG
Subjects
More information
Scope and Contents
Contents
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...
Alternative Titles
Full title
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_0613a1a7728148fc811377e4ad38bf20
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_0613a1a7728148fc811377e4ad38bf20
Other Identifiers
ISSN
2227-7390
E-ISSN
2227-7390
DOI
10.3390/math8081266
