PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS
Abstract
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.
Downloads
References
J. A. Gallian, “A DYNAMIC SURVEY OF GRAPH LABELING,” Electron. J. Combin., vol. 1000, p. DS6: Dec 2, Dec. 2022, doi: https://doi.org/10.37236/11668.
W.D. Wallis, Magic Graphs. Birkhäuser, Boston, 2001.
Sarbaini, Nazaruddin, M. Rizki, M.I.H. Umam, M. L. Hamzah, and T. A. Prasetyo, “RADIO LABELING OF BANANA GRAPHS” BAREKENG : Journal of Mathematics and Its Applications, vol. 17, issue 1, pp. 0165-3017, 2023.doi: https://doi.org/10.30598/barekengvol17iss1pp0165-0170
C. C. Marzuki, A. Utami, M. Elviyenti, and Y. Mudao, “ON THE TOTAL VERTEX IRREGULARITY STRENGTH OF SERIES PARALLEL GRAPH SP(m,r,4), ”BAREKENG : Journal of Mathematics and Its Applications, vol. 18, issue 1, pp. 0213-0222, 2024.doi: https://doi.org/10.30598/barekengvol18iss1pp0213-0222
A. S. Brata, T. Nusantara, D. Rahmadani, A. Gani, and V. Kusumasari, “ON THE PROPERTIES OF ANTI-FUZZY GRAPH MAGIC LABELING, ”AIP Conference Proceedings, 2194, 2194, 020012, 2019.doi ; https://doi.org/10.1063/1.5139744
I. Firmansa, T. Nusantara, D. Rahmadani, A. Gani, H. Susanto, and Purwanto, “ON THE PROPERTIES OF BIPOLAR ANTI FUZZY GRAPH MAGIC LABELING,” AIP Conference Proceedings, 2194, 020028, 2019.doi: https://doi.org/10.1063/1.5139760
P. Haxell, O. Pikhurko, and Taraz, “PRIMALITY OF TREES,” J. Combinatorics, vol. 2, pp. 481-500, 2011. doi: https://doi.org/10.4310/JOC.2011.v2.n4.a1
A. Tout, A. Dabboucy, K. Howalla, “PRIME LABELING OF GRAPHS,” Nat. Acad. Sci. Lett., vol.11, pp. 365–368, 1982
K. H. Rosen, DISCRETE MATHEMATICS AND ITS APPLICATIONS. M.cGraw-Hill., vol. 6, 1999. https://www.academia.edu/download/28147631/syllabus.pdf
Cormen and H. Thomas, INTRODUCTION TO ALGORITHMS. MIT Press, 2022
S. K. Vaidya and U. M. Prajapati, “SOME NEW RESULTS ON PRIME GRAPHS,” OJDM, vol. 02, no. 03, pp. 99–104, 2012, doi: https://doi.org/10.4236/ojdm.2012.23019.
A. Kansagara and S. Patel, “PRIME LABELING IN THE CONTEXT OF WEB GRAPHS WITHOUT CENTER,” AKCE International Journal of Graphs and Combinatorics, vol. 18, no.3, pp. 132-142, 2021. doi: https://doi.org/10.1080/09728600.2021.1974286
Lee, S., Wui, I., and Yeh, J. 1988. ON THE AMALGAMATION OF PRIME GRAPHS. BULL. MALAYSIAN MATH. SOC. (SECOND SERIES), 11 59-67.
G. Chartrand, C. Egan, and P. Zhang, HOW TO LABEL A GRAPH. in SpringerBriefs in Mathematics. Cham: Springer International Publishing, 2019. doi: https://doi.org/10.1007/978-3-030-16863-6.
D. R. Putra, M. Kiftiah, and F. Fran, “PELABELAN PRIMA PADA GRAF SIMPUL SEMI TOTAL DARI GRAF SIKAT,” Var, vol. 5, no. 2, p. 117, Oct. 2022, doi: https://doi.org/10.26737/var.v5i2.2699.
D. S. Meena and K. Vaithilingam, “PRIME LABELING FOR SOME HELM RELATED GRAPHS,” International Journal of Innovative Research in Science, Engineering and Technology, vol. 2, no. 4, 2013.
H. Komarullah, “PELABELAN PRIMA DAN KOPRIMA PADA GRAF P_M K_N DAN GRAF P_M P_N,” Prosiding Seminar Pendidikan Matematika dan Matematika UNY, vol. 2, 2023. doi: https://doi.org/10.21831/pspmm.v8i2.312
K. Vaithilingam and D. S. Meena, “PRIME LABELING FOR SOME CROWN RELATED GRAPHS,” International Journal of Scientific & Technology Research, vol. 2, no. 3, 2013.
H.-L. Fu and K.-C. Huang, “ON PRIME LABELLINGS,” Discrete Math., vol. 127, no. 1–3, pp. 181–186, 1994.doi: https://doi.org/10.1016/0012-365X(92)00477-9
S. Ashokkumar and S. Maragathavalli, “PRIME LABELLING OF SOME SPECIAL GRAPHS,” IOSR Journal of Mathematics (IOSR-JM), vol. 11, no. 1, pp. 01-05, 2015.
K. Carlson, “GENERALIZED BOOKS AND C_m-Snakes Are Prime Graphs,” Ars Combin., vol. 80, pp. 215-221, 2006.
T. Koshy, DISCRETE MATHEMATICS WITH APPLICATIONS. Elsevier Academic Press, 2004.
K. H. Rosen, ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS. AddisonWesley, 2011.
N. Mwamba, “THE RELATIVELY PRIME NATURE OF CONSECUTIVE INTEGERS,” International Journal of Mathematics And its Applications, vol. 10, no. 1, 97–100, 2022.
Copyright (c) 2025 Desi Rahmadani, Ardi Aldianyah, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this Journal agree to the following terms:
- Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
- Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
- Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.
1.gif)
