On the strong metric dimension of the strong products of graphs
On the strong metric dimension of the strong products of graphs
About this item
Full title
Author / Creator
Publisher
Warsaw: De Gruyter Open
Journal title
Language
English
Formats
Publication information
Publisher
Warsaw: De Gruyter Open
Subjects
More information
Scope and Contents
Contents
Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there
exists some shortest u-w path containing v or some shortest v-w path containing u. A set S of vertices is a strong
resolving set for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality
of a strong...
Alternative Titles
Full title
On the strong metric dimension of the strong products of graphs
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_a421a15e367342918e615af52bfac4f3
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_a421a15e367342918e615af52bfac4f3
Other Identifiers
ISSN
2391-5455
E-ISSN
2391-5455
DOI
10.1515/math-2015-0007
