## Abstract

Let G(V , E) be a connected graph. A vertex w strongly resolves a pair of vertices u, v in V if there exists some shortest u-w path containing v or some shortest v -w path containing u. A set W ⊂ V of vertices is called a strong resolving set for G if every pair of vertices of V \W is strongly resolved by some vertex of W. A strong resolving set of minimum cardinality is called a strong metric basis and this cardinality is called the strong metric dimension of G. The strong metric dimension problem is to find a strong metric basis in a graph. In this paper we investigate the strong metric dimension problem for certain nanostructures.

Original language | English |
---|---|

Pages (from-to) | 354-358 |

Number of pages | 5 |

Journal | Journal of Computational and Theoretical Nanoscience |

Volume | 14 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 2017 |

## Keywords

- Metric dimension
- Nanostructures
- Strong metric dimension

## ASJC Scopus subject areas

- General Chemistry
- General Materials Science
- Condensed Matter Physics
- Computational Mathematics
- Electrical and Electronic Engineering