Melola Discovery

← Melola Discovery

Akses terbuka Jurnal Tanpa peringkat SINTA

Prime Labeling of Special Graph Classes Constructed from Dutch Windmill Graphs

Jurnal Matematika, Statistika dan Komputasi · Vol. 22 No. 1 (2025) · hlm. 178–186

DOI
10.20956/j.v22i1.44939
ISSN
2614-8811, 1858-1382
Terbit
2025-09-08
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

Let G be a simple graph of order n. Prime labeling is a bijective function f:V(G)→{1,2,…,n} such that gcd⁡(f(u),f(v))=1 for every pair of adjacent vertices u,v in G. A graph G that satisfies the definition of prime labeling is called a prime graph. The Dutch windmill graph D_r^n is a graph obtained by taking n copies of cycle graph C_r with a vertex in common. The double quadrilateral graph DQ is a graph constructed from two copies of C_4 and identifying one edge from each of them. The graph obtained by taking n copies of DQ and identifying one vertex of degree 3 from each of them as a common central vertex is called the double quadrilateral Dutch windmill graph DQ_n, for n≥1. Furthermore, graphs D_r^n and DQ_n becomes the base graph to construct two new graph classes, namely graph P_2 [D_r^n] and flower double quadrilateral graph FDQ_n. Both graph classes, constructed from the Dutch windmill graph, also contain even cycles. From previous research, it is known that graphs P_2 [D_4^n] and flower double quadrilateral graph FDQ_n have odd harmonious labeling. However, the determination of prime labeling on both classes is still an open problem. In this paper, we show that two classes of graphs constructed from Dutch windmill graphs with even cycles, namely graphs P_2 [D_4^n] and flower double quadrilateral graphs FDQ_n for n≥1 have a prime labeling. The result of this research shows that these graphs are prime graphs.

Kata kunci

Jaringan kolaborasi para penulis

9 penulis · 17 tautan kepenulisan bersama

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

  • State University of Malang
  • 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
Vita KusumasariState University of Malang1
Ardi AldiansyahState University of Malang1
Dina PratiwiState University of Malang1
Mahmuddin YunusState University of Malang1
Tjang Daniel ChandraState University of Malang1
Afie AhmadaniState University of Malang1
Mochammad HafiizhState University of Malang1

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">Prime Labeling of Special Graph Classes Constructed from Dutch Windmill Graphs </dc:title>
	<dc:creator xml:lang="en">Lestari, Jayanti Anggraini Putri</dc:creator>
	<dc:creator xml:lang="en">Rahmadani, Desi</dc:creator>
	<dc:subject xml:lang="en">Prime labeling</dc:subject>
	<dc:subject xml:lang="en">Windmill graph</dc:subject>
	<dc:subject xml:lang="en">Classes of Dutch windmill graph</dc:subject>
	<dc:description xml:lang="en">Let G be a simple graph of order n. Prime labeling is a bijective function f:V(G)→{1,2,…,n} such that gcd⁡(f(u),f(v))=1 for every pair of adjacent vertices u,v in G. A graph G that satisfies the definition of prime labeling is called a prime graph. The Dutch windmill graph D_r^n is a graph obtained by taking n copies of cycle graph C_r with a vertex in common. The double quadrilateral graph DQ is a graph constructed from two copies of C_4 and identifying one edge from each of them. The graph obtained by taking n copies of DQ and identifying one vertex of degree 3 from each of them as a common central vertex is called the double quadrilateral Dutch windmill graph DQ_n, for n≥1. Furthermore, graphs D_r^n and DQ_n becomes the base graph to construct two new graph classes, namely graph P_2 [D_r^n] and flower double quadrilateral graph FDQ_n. Both graph classes, constructed from the Dutch windmill graph, also contain even cycles. From previous research, it is known that graphs P_2 [D_4^n] and flower double quadrilateral graph FDQ_n have odd harmonious labeling. However, the determination of prime labeling on both classes is still an open problem. In this paper, we show that two classes of graphs constructed from Dutch windmill graphs with even cycles, namely graphs P_2 [D_4^n] and flower double quadrilateral graphs FDQ_n for n≥1 have a prime labeling. The result of this research shows that these graphs are prime graphs.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2025-09-08</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/44939</dc:identifier>
	<dc:identifier>10.20956/j.v22i1.44939</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 22 No. 1 (2025): SEPTEMBER 2025; 178-186</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/44939/13339</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2025 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>