On the Strong Metric Dimension of Cartesian Sum Graphs

Abstract

A vertex w of a connected graph 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 metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G… (More)
DOI: 10.3233/FI-2015-1263

Topics

  • Presentations referencing similar topics