38 citations · 53 across the 5 of their papers we have counts for
5 papers
On the locating-chromatic number of corona product of graphs
Dian Kastika Syofyan, Suhadi Wido Saputro, Edy Tri Baskoro +1
Let be a finite, simple, and connected graph. The locating-chromatic number of a graph can be defined as the cardinality of a minimum resolving partition of the verte…
Multiset Dimensions of Trees
Yusuf Hafidh, Rizki Kurniawan, Suhadi Saputro +3
Let be a connected graph and be a set of vertices of . The representation multiset of a vertex with respect to , , is defined as a multiset of distance…
The local metric dimension of subgraph-amalgamation of graphs
Gabriel A. Barragan-Ramirez, Rinovia Simanjuntak, Suhadi W. Saputro +1
A vertex is said to distinguish two other vertices and of a nontrivial connected graph G if the distance from to is different from the distance from to .…
Metric Dimension of Amalgamation of Graphs
Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro
A set of vertices resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in . The metric dimension of is the minimum card…
The Metric Dimension of Regular Bipartite Graphs
S. W. Saputro, E. T. Baskoro, A. N. M. Salman +2
A set of vertices resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in . A metric dimension of is the minimum cardin…