On Prime and Coprime Edge Labeling of Some Graphs
DOI:
https://doi.org/10.25077/jmua.15.3.291-301.2026Keywords:
Coprime Edge Labeling, Minimum Coprime Edge Number,, Prime Edge LabelingAbstract
A coprime edge labeling of a graph is defined as a labeling in which positive integer labels are assigned to each edge of the graph according to certain rules. In this labeling, every pair of edges adjacent to the same vertex must have relatively prime labels, meaning they have no common factors other than one. If the number of labels used is equal to the total number of edges of the graph, this labeling method is designated as a prime edge labeling. In the context of coprime edge labeling, the smallest possible number of labels that allows such a labeling is referred to as the minimum coprime edge number. The present study analyzes prime edge labeling and coprime edge labeling on several special graphs, including tadpoles, combs, disjoint unions of combs, unions of two cycles, disjoint unions of paths, volcano graphs, and regular caterpillars. Furthermore, this study provides precise values for the minimum coprime edge number of the Cn \cup Cm graphs with odd n and m, volcano graphs, and regular caterpillars.
Downloads
References
[1] Griggs, J.R., Yeh, R.K., 1992, Labelling Graphs with a Condition at Distance 2, SIAM Journal on Discrete Mathematics, Vol. 5: 586–595.
[2] Sari, I.P., Fahroza, M.F., Mufit, M.I., Qathrunad, I.F., 2021, Implementation of Dijkstra’s Algorithm to Determine the Shortest Route in a City, Journal of Computer Science, Information Technology and Telecommunication Engineering, Vol. 2: 134–138.
[3] Prihandoko, A.C., Dafik, D., Agustin, I.H., 2019, Implementation of Super H-Antimagic Total Graph on Establishing Stream Cipher, Indonesian Journal of Combinatorics, Vol. 3: 14–23.
[4] Majeed, A., Rauf, I., 2020, Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks, Inventions, Vol. 5: 1–39.
[5] Gallian, J.A., 2022, A Dynamic Survey of Graph Labeling, Electronic Journal of Combinatorics, Vol. 6: 4–623.
[6] Tout, A., Dabboucy, A., Howalla, K., 1982, Prime Labeling of Graphs, Nat. Acad. Sci. Letters, Vol. 11: 365–368.
[7] Berliner, A.H., Hook, J., Mbirika, A., Dean, N., Marr, A., McBee, C.D., 2016, Coprime and Prime Labelings of Graphs, Journal of Integer Sequences, Vol. 19: 1–14.
[8] Prajapati, U., Shah, K., 2018, On Odd Prime Labeling, International Journal of Research and Analytical Reviews, Vol. 5: 284–294.
[9] Janani, R., Ramachandran, T., 2022, On Relatively Prime Edge Labeling of Graphs, Engineering Letters, Vol. 30: 659–665.
[10] Janani, R., Ramachandran, T., 2022, Coprime Edge Labeling of Graphs, SSRN, available at: [https://ssrn.com/abstract=4486269](https://ssrn.com/abstract=4486269).
[11] Lau, G.C., Chu, H.H., Suhadak, N., Foo, F.Y., Ng, H.K., 2016, On SD-prime Cordial Graphs, International Journal of Pure and Applied Mathematics, Vol. 106: 1017–1028.
[12] Vaidya, S., Prajapati, U.M., 2011, Some Results on Prime and K-prime Labeling, Journal of Mathematics Research, Vol. 3: 66–75.
[13] Arockiamary, S.T., Babujee, J.B., Vijayalakshmi, G., 2022, K-Prime Total Labeling of Graphs, Advances & Applications in Discrete Mathematics, Vol. 35: 45–49.
[14] Patel, S.K., Shrimali, N.P., 2018, Neighborhood-Prime Labeling of Some Product Graphs, Algebra and Discrete Mathematics, Vol. 25: 118–129.
[15] Kumar, T.R., Varkey, T.M., 2018, A Note on Total Neighborhood Prime Labeling, International Journal of Pure and Applied Mathematics, Vol. 118: 1007–1013.
[16] Pandya, P.B., Shrimali, N., 2018, Vertex-Edge Neighborhood Prime Labeling of Some Graphs, International Journal of Scientific Research and Review, Vol. 7: 735–743.
[17] DeMaio, J., Jacobson, J., 2014, Fibonacci Number of the Tadpole Graph, Electronic Journal of Graph Theory and Applications (EJGTA), Vol. 2: 129–138.
[18] Harary, F., 2018, Graph Theory, Addison-Wesley Publishing Company, Michigan.
[19] Dhanalakshmi, S., Parvathi, N., 2018, Mean Square Cordial Labelling Related to Some Acyclic Graphs and its Rough Approximations, Journal of Physics: Conference Series, Vol. 1000: 1–9, IOP Publishing.
[20] Dafik, D., Wahidah, R.N., Albirri, E.R., Husain, S.K.S., 2023, On the Study of Rainbow Antimagic Coloring of Special Graphs, CAUCHY: Jurnal Matematika Murni dan Aplikasi, Vol. 7: 585–596.
[21] Sukirman, 2016, Teori Bilangan, Universitas Terbuka, Tangerang Selatan.
[22] Komarullah, H., Slamin, S., Wijaya, K., 2022, A Minimum Coprime Number for Amalgamation of Wheel, in International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021), pp. 53–57, Atlantis Press.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.
Copyright Holder
The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.
Author Rights
Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:
-
Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.
-
Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.
-
Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.
Creative Commons License (CC BY-SA 4.0)
Under the CC BY-SA 4.0 license, users are free to:
-
Share: Copy and redistribute the material in any medium or format.
-
Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.
These permissions are subject to the following conditions:
-
Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.
-
ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.
-
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.
For more information about the CC BY-SA 4.0 license, please visit:
https://creativecommons.org/licenses/by-sa/4.0/
Third-Party Content
Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.
Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.
Copyright and Licensing Information
Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.
