Akses terbuka
Jurnal
Fibonacci Prime Labelling on the Class of Flower Graphs
Jurnal Matematika, Statistika dan Komputasi
ISSN 2614-8811, 1858-1382
Terbit 2025-09-08
Penerbit Department of Mathematics, Hasanuddin University
Bahasa en
Abstrak
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numbers as vertex labels while satisfying certain conditions. A graph labeling is an assignment of labels (elements of some set) to elements of a graph, usually the vertices or the edges (or both) of the graph. Several previous studies have shown that some classes of graphs, such as cycle graphs, fan graphs, and umbrella graphs, satisfy the criteria for Fibonacci prime labeling. Moreover, previous research has proven that flower graphs and double flower graphs admit prime labeling. Motivated by these findings, this study aims to explore whether these two classes of graphs also admit Fibonacci prime labeling. This exploration seeks to identify a potential relationship between prime labeling and Fibonacci prime labeling in these graph classes. This research focuses on graphs with an even number of vertices. The methods used include literature review and mathematical proof. The novelty of this study lies in extending the results of prime labeling to Fibonacci prime labeling for flower and double flower graphs. The results show that both graph classes with an even number of vertices belong to the class of graphs that admit Fibonacci prime labeling.
Jaringan kolaborasi para penulis
16 penulis ·
31 tautan kepenulisan bersama
· 4 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
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 8 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">Fibonacci Prime Labelling on the Class of Flower Graphs</dc:title>
<dc:creator xml:lang="en">Rahmadani, Desi</dc:creator>
<dc:creator xml:lang="en">Ahmadani, Afie</dc:creator>
<dc:creator xml:lang="en">Chandra, Tjang Daniel</dc:creator>
<dc:creator xml:lang="en">Hafiizh, Mochammad</dc:creator>
<dc:subject xml:lang="en">graph labeling</dc:subject>
<dc:subject xml:lang="en">Fibonacci prime labeling</dc:subject>
<dc:subject xml:lang="en">flower graph</dc:subject>
<dc:description xml:lang="en">Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numbers as vertex labels while satisfying certain conditions. A graph labeling is an assignment of labels (elements of some set) to elements of a graph, usually the vertices or the edges (or both) of the graph. Several previous studies have shown that some classes of graphs, such as cycle graphs, fan graphs, and umbrella graphs, satisfy the criteria for Fibonacci prime labeling. Moreover, previous research has proven that flower graphs and double flower graphs admit prime labeling. Motivated by these findings, this study aims to explore whether these two classes of graphs also admit Fibonacci prime labeling. This exploration seeks to identify a potential relationship between prime labeling and Fibonacci prime labeling in these graph classes. This research focuses on graphs with an even number of vertices. The methods used include literature review and mathematical proof. The novelty of this study lies in extending the results of prime labeling to Fibonacci prime labeling for flower and double flower graphs. The results show that both graph classes with an even number of vertices belong to the class of graphs that admit Fibonacci prime labeling.</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/45070</dc:identifier>
<dc:identifier>10.20956/j.v22i1.45070</dc:identifier>
<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 22 No. 1 (2025): SEPTEMBER 2025; 139-148</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/45070/13336</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>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 8 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref.
Sitasi artikel ini
APA 7
Rahmadani, D., Ahmadani, A., Chandra, T. D., & Hafiizh, M. (2025). Fibonacci Prime Labelling on the Class of Flower Graphs. Jurnal Matematika, Statistika dan Komputasi, 22(1), 139–148. https://doi.org/10.20956/j.v22i1.45070
Salin
IEEE
D. Rahmadani, A. Ahmadani, T. D. Chandra, and M. Hafiizh, “Fibonacci Prime Labelling on the Class of Flower Graphs,” Jurnal Matematika, Statistika dan Komputasi, vol. 22, no. 1, pp. 139–148, 2025, doi: 10.20956/j.v22i1.45070.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.