Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 4 (2025) · hlm. 2431–2442

DOI
10.30598/barekengvol19iss4pp2431-2442
ISSN
2615-3017, 1978-7227
Terbit
2025-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph with a vertex-set and an edge-set. The order of graph, denoted by, is the number of vertices on. The prime labeling is a bijective function, such that the labels of any two adjacent vertices in G are relatively prime or, for every two adjacent vertices and in. If a graph can be labeled with prime labeling, then the graph can be said to be a prime graph. A flower graph is a graph formed by helm graph by connecting its pendant vertices (the vertices have degree one) to the central vertex of, such a flower graph is denoted as In this research, we employ constructive and analytical methods to investigate prime labelings on specific graph classes. Definitions, lemmas, and theorems are developed as the main results in this research. The amalgamation is a graph formed by taking all by taking all the and identifying their fixed vertices. If, then we write with. In previous research, it has been shown that the flower graphs, for are prime graphs. Continuing the research, we prove that two classes of amalgamation of flower graphs are prime graphs.

Jaringan kolaborasi para penulis

21 penulis · 54 tautan kepenulisan bersama · 18 lintas organisasi

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

  • State University of Malang
  • University of Brawijaya
  • Indonesian Institute of Sciences
  • Kanazawa University
  • Afiliasi tidak diketahui
  • 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
Rahmadwati RahmadwatiUniversity of Brawijaya1
Muhammad Fauzan Edy PurnomoUniversity of Brawijaya1
Rudy YuwonoUniversity of Brawijaya1
Rakhmad RomadhoniUniversity of Brawijaya1
Azizurrahman RafliUniversity of Brawijaya1
Yuyu WahyuIndonesian Institute of Sciences1
Akio KitagawaKanazawa University1
Jayanti Anggraini Putri LestariState University of Malang1
Tjang Daniel ChandraState University of Malang1
Afie AhmadaniState University of Malang1
Mochammad HafiizhState University of Malang1
Mutina MutinaAfiliasi tidak diketahui1
SUDIRMAN SUDIRMANState University of Malang1
Tjang Daniel ChandraAfiliasi tidak diketahui1
Makbul MuksarAfiliasi tidak diketahui1
Rustanto RahardiAfiliasi tidak diketahui1

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://ojs3.unpatti.ac.id/index.php/barekeng/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-US">PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS</dc:title>
	<dc:creator>Rahmadani, Desi</dc:creator>
	<dc:creator>Aldiansyah, Ardi</dc:creator>
	<dc:creator>Pratiwi, Dina</dc:creator>
	<dc:creator>Yunus, Mahmuddin</dc:creator>
	<dc:creator>Kusumasari, Vita</dc:creator>
	<dc:description xml:lang="en-US">Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph &amp;nbsp;with a vertex-set &amp;nbsp;and an edge-set . The order of graph , denoted by , is the number of vertices on . The prime labeling is a bijective function , such that the labels of any two adjacent vertices in G are relatively prime or , for every two adjacent vertices &amp;nbsp;and in . If a graph can be labeled with prime labeling, then the graph can be said to be a prime graph. A flower graph is a graph formed by helm graph &amp;nbsp;by connecting its pendant vertices (the&amp;nbsp;vertices have&amp;nbsp;degree one) to the central vertex of , such a flower graph is denoted as &amp;nbsp;In this research, we employ constructive and analytical methods to investigate prime labelings on specific graph classes. Definitions, lemmas, and theorems are developed as the main results in this research. The amalgamation is a graph formed by taking all by taking all the &amp;nbsp;and identifying their fixed vertices . If , then we write &amp;nbsp;with . In previous research, it has been shown that the flower graphs , for &amp;nbsp;are prime graphs. Continuing the research, we prove that two classes of amalgamation of flower graphs &amp;nbsp;are prime graphs.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-09-01</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://ojs3.unpatti.ac.id/index.php/barekeng/article/view/16981</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss4pp2431-2442</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application; 2431-2442</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss4year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/16981/11046</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Desi Rahmadani, Ardi Aldianyah, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>