A Note On The Partition Dimension of Thorn of Fan Graph
Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of concerning is the k-vector, where denotes the distance between and for. The k-partition is said to be resolving if for every two vertices, the representation. The minimum k for which there is a resolving k-...
Main Author: | Auli Mardhaningsih |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Science and Technology, UIN Sunan Ampel Surabaya
2019-05-01
|
Series: | Mantik: Jurnal Matematika |
Subjects: | |
Online Access: | http://jurnalsaintek.uinsby.ac.id/index.php/mantik/article/view/512 |
Similar Items
-
On The Partition Dimension of Disconnected Graphs
by: Debi Oktia Haryeni, et al.
Published: (2017-06-01) -
A note on the metric dimension of subdivided thorn graphs
by: Lyra Yulianti, et al.
Published: (2019-06-01) -
On Sharp Bounds on Partition Dimension of Convex Polytopes
by: Yu-Ming Chu, et al.
Published: (2020-01-01) -
The connected partition dimension of truncated wheels
by: Lyndon L. Lazaro, et al.
Published: (2021-05-01) -
A method to construct graphs with certain partition dimension
by: Debi Oktia Haryeni, et al.
Published: (2019-10-01)