Claim Missing Document
Check
Articles

Found 32 Documents
Search

Dimensi Metrik Dominasi Pada Graf Globe dan Graf Pendant Globe Muchammad Abrori; Atifah Rahmah; Deddy Rahmadi
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 1 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 1 Edisi Ap
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i1.9103

Abstract

The dominating metric dimension of a graph is defined as the minimum cardinality of a set that is both a resolving set and a dominating set. A node is said to be an is a differentiating set if for every two different vertices  holds  and said to be a set of a dominant if there is at least one node adjacent to the set domination. The Globe  graph is a graph obtained from two protected vertices connected by  paths of length two. The Pendant Globe Graph is  is a graph obtained from a globe graph by adding paths along it . This research discusses the metric dimensions and dominant metric dimension on the globe graph  for  as well as metric dimensions on the pendant globe graph for  and . The method in this research begins with the concept of metric dimension, the concept of metric dimension then dominant continued with the introduction of the characteristics of globe graphs and pendant globe graphs. Furthermore, the metric dimension and dominance dimension will be sought in globe graphs and pendant globe graphs for  vertices.
Edge Metric Dimension of Uniform Theta Graphs and Sunflower Graphs Muchammad Abrori; Deddy Rahmadi; Lailatul Ulla Safitri; Alvian Nur Rohman; Jaqueline Widad Zuha
Jurnal Matematika, Statistika dan Komputasi Vol. 23 No. 1 (2026): September 2026
Publisher : Department of Mathematics, Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20956/t02sds33

Abstract

Let be a graph with vertex set and edge set . In graph theory, an edge resolving set is defined as a subset of vertices such that every edge in has a distinct distance representation with respect to . The minimum cardinality of an edge resolving set is called the edge metric dimension of , denoted by . This study aimed to determine the edge metric dimension of the uniform theta graph and the sunflower graph . The method employed a graph-structure approach and distance analysis between edges and vertices supported by a literature review. The results showed that for and , for , and for . Furthermore, for and , for and , for , and for .