Melola Discovery

← Melola Discovery

Open access Journal

Fibonacci Prime Labelling on the Class of Flower Graphs

Jurnal Matematika, Statistika dan Komputasi · Vol. 22 No. 1 (2025) · pp. 139–148

DOI
10.20956/j.v22i1.45070
ISSN
2614-8811, 1858-1382
Published
2025-09-08
Publisher
Department of Mathematics, Hasanuddin University
Language
en
License
creativecommons.org/licenses/by/4.0

Abstract

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.

Keywords

Collaboration network of the authors

14 authors · 28 co-authorship links · 4 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • State University of Malang
  • Universitas PGRI Madiun
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Abdur Rahman As’ariState University of Malang1
Wasilatul MurtafiahUniversitas PGRI Madiun1
Cholis Sa’dijahState University of Malang1
Susiswo SusiswoState University of Malang1
Gloria Indah PermataState University of Malang1
Vita KusumasariState University of Malang1
Ardi AldiansyahState University of Malang1
Dina PratiwiState University of Malang1
Mahmuddin YunusState University of Malang1
Jayanti Anggraini Putri LestariState University of Malang1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, first harvested 5 Nov 2026, last seen 8 Nov 2026.
Original metadata (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>