Edge Metric Dimension of Uniform Theta Graphs and Sunflower Graphs

Muchammad Abrori (UIN Sunan Kalijaga Yogyakarta)
Deddy Rahmadi (Universitas Islam Negeri Sunan Kalijaga)
Lailatul Ulla Safitri (UIN Sunan Kalijaga Yogyakarta)
Alvian Nur Rohman (UIN Sunan Kalijaga Yogyakarta)
Jaqueline Widad Zuha (UIN Sunan Kalijaga Yogyakarta)

JURNAL MATEMATIKA STATISTIKA DAN KOMPUTASI
Vol. 23 No. 1 (2026): September 2026

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 .