Open AccessThe local strong metric dimension in the join of graphs
Author(s) -
Rica Amalia,
Firdausiyah,
Tony Yulianto,
Faisol Faisol,
Kuzairi
Publication year - 2022
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2157/1/012004
Subject(s) - metric dimension , combinatorics , mathematics , vertex (graph theory) , distance , discrete mathematics , cardinality (data modeling) , shortest path problem , graph , chordal graph , 1 planar graph , computer science , data mining
Let G be a connected graph. A vertex w is said to strongly resolve a pair u, ν of vertices of G if there exists some shortest u − w path containing ν or some shortest ν − w path containing u . A set W of vertices is a local strong resolving set for G if every pair of adjacent vertices of G is strongly resolved by some vertex of W . The smallest cardinality of a local strong resolving set for G is called the local strong metric dimension of G . In this paper we studied the local strong metric dimension in the join of graphs. We use the path, cycle, complete, and star graphs in this studies.