Article Per Year (5 Year)
p-Index From 2020 - 2025
0.408
P-Index
This Author published in this journals
All Journal Jurnal Matematika UNAND
Hadiputra, Fawwaz Fakhrurrozi
Unknown Affiliation
Computer Science & IT Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
On Metric Dimension of Edge Comb Product of Symmetric Graphs Maryati, Tita Khalis; Sobiruddin, Dindin; Hadiputra, Fawwaz Fakhrurrozi
Jurnal Matematika UNAND Vol 13, No 4 (2024)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.13.4.349-357.2024

Abstract

Consider a finite graph G that is simple, undirected, and connected. Let W be an ordered set of vertices with |W| = k. The representation of a vertex v is defined as an ordered k-tuple that consists of the distances from vertex v to each vertex in W. The set W is called a resolving set for G if the k-tuples for any two vertices in G are distinct. The metric dimension of G, denoted by dim(G), is the smallest possible size of such a set W. In this paper, we determine the metric dimension of edge comb product of trees with complete multipartites or petersen graphs.
On Metric Dimension of Edge Comb Product of Symmetric Graphs Maryati, Tita Khalis; Sobiruddin, Dindin; Hadiputra, Fawwaz Fakhrurrozi
Jurnal Matematika UNAND Vol. 13 No. 4 (2024)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.13.4.349-357.2024

Abstract

Consider a finite graph G that is simple, undirected, and connected. Let W be an ordered set of vertices with |W| = k. The representation of a vertex v is defined as an ordered k-tuple that consists of the distances from vertex v to each vertex in W. The set W is called a resolving set for G if the k-tuples for any two vertices in G are distinct. The metric dimension of G, denoted by dim(G), is the smallest possible size of such a set W. In this paper, we determine the metric dimension of edge comb product of trees with complete multipartites or petersen graphs.
Co-Authors Dindin Sobiruddin, Dindin Maryati, Tita Khalis