Melola Discovery

← Melola Discovery

Akses terbuka Jurnal Tanpa peringkat SINTA

Edge Metric Dimension of Uniform Theta Graphs and Sunflower Graphs

Jurnal Matematika, Statistika dan Komputasi · Vol. 23 No. 1 (2026) · hlm. 76–93

DOI
10.20956/t02sds33
ISSN
2614-8811, 1858-1382
Terbit
2026-09-15
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

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.

Kata kunci

Jaringan kolaborasi para penulis

5 penulis · 10 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Sunan Kalijaga State Islamic University Yogyakarta
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Edge Metric Dimension of Uniform Theta Graphs and Sunflower Graphs</dc:title>
	<dc:creator xml:lang="en">Abrori, Muchammad</dc:creator>
	<dc:creator xml:lang="en">Rahmadi, Deddy</dc:creator>
	<dc:creator xml:lang="en">Safitri, Lailatul Ulla</dc:creator>
	<dc:creator xml:lang="en">Rohman, Alvian Nur</dc:creator>
	<dc:creator xml:lang="en">Zuha, Jaqueline Widad</dc:creator>
	<dc:subject xml:lang="en">edge metric dimension</dc:subject>
	<dc:subject xml:lang="en">edge resolving set</dc:subject>
	<dc:subject xml:lang="en">uniform theta graph</dc:subject>
	<dc:subject xml:lang="en">sunflower graph</dc:subject>
	<dc:subject xml:lang="en">graph theory</dc:subject>
	<dc:subject xml:lang="en">distance in graph</dc:subject>
	<dc:subject xml:lang="en">metric dimension</dc:subject>
	<dc:subject xml:lang="en">edge metric dimension</dc:subject>
	<dc:description xml:lang="en">Let &amp;nbsp;be a graph with vertex set &amp;nbsp;and edge set . In graph theory, an edge resolving set is defined as a subset of vertices &amp;nbsp;such that every edge in &amp;nbsp;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 &amp;nbsp;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 &amp;nbsp;for &amp;nbsp;and , &amp;nbsp;for , and &amp;nbsp;for . Furthermore, &amp;nbsp;for &amp;nbsp;and , &amp;nbsp;for &amp;nbsp;and , &amp;nbsp;for , and &amp;nbsp;for .</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2026-09-15</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Text</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/50746</dc:identifier>
	<dc:identifier>10.20956/t02sds33</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 23 No. 1 (2026): September 2026; 76-93</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/50746/15005</dc:relation>
	<dc:coverage xml:lang="en">Graph Theory; Edge Metric Dimension; Uniform Theta Graph; Sunflower Graph</dc:coverage>
	<dc:rights xml:lang="en">Copyright (c) 2026 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>