(STRONG) RAINBOW CONNECTION NUMBERS ON CORONA PRODUCT OF PATH AND COMPLETE GRAPHS

Authors

  • Andry Sulistyanto Graph and Algebra Research Group Jurusan Matematika, FMIPA Universitas Jember
  • Ikhsanul Halikin Graph and Algebra Research Group Jurusan Matematika, FMIPA Universitas Jember
  • Kusbudono Kusbudiono Graph and Algebra Research Group Jurusan Matematika, FMIPA Universitas Jember
  • Kristiana Wijaya Graph and Algebra Research Group Jurusan Matematika, FMIPA Universitas Jember

DOI:

https://doi.org/10.25077/jmua.14.4.376-389.2025

Keywords:

Rainbow path, rainbow connection, strong rainbow connection

Abstract

Let G be an edge-colored, where adjacent edges may have the same color. A u-v path in G is a rainbow u-v path if no two edges of u-v path are colored the same. The graph G is called rainbow-connected if G contains a rainbow u-v path for every two vertices u and v of G. A rainbow connection number of rainbow-connected G is the minimum color in G. A rainbow u-v path is called a rainbow u-v geodesic if a rainbow u-v path of length distance from a vertex u to v. A graph G is strongly rainbow-connected if G contains a rainbow u-v geodesic for every two vertices u and v of G. The minimum color of the edges of G such that G is strongly rainbow-connected is the strong rainbow connection number. In this paper, we disccus (strong) rainbow connection number of corona product of path and complete graph. 

Downloads

Download data is not yet available.

References

Chartrand, G., G. L. Johns, K. A. Mc Keon, dan P. Zhang. (2008). Rainbow connection in graphs. Mathematica bohemica, 133(1): 85-98.

Chartrand, G., L. Lesniak, dan P. Zhang. (2016). Graphs & Digraphs (6th ed.). Britania Raya: Taylor & Francis Group, LLC.

Darmawan, R.N. (2015), Analisis Rainbow Connection Number pada Graf Khusus dan Hasil Operasinya, Tesis, Jember: Universitas Jember.

Estetikasari, D., dan S. Sy (2013). On the rainbow connection for some corona graphs. Applied Mathematical Sciences, 7(100): 4975-4980

Harary, F. dan Fructh, R. (1970). On The Corona of Two Graphs. Aequationes Mathematicae.

Jagannatharao, K. S., dan R. Murali. (2019). Rainbow Coloring in Some Corona Product Graphs. Malaya Journal of Matematik, 7(1): 127-131.

Maulani, A., Soya, F.Y.O. P., Dian, S., & Kiki, A.S. (2019). Rainbow Connection Number of C_m⊙P_n and C_m⊙C_n. Indonesian Journal of Combinatorics, 3(2): 95-108.

Downloads

Published

31-10-2025

How to Cite

Sulistyanto, A., Halikin, I., Kusbudiono, K., & Wijaya, K. (2025). (STRONG) RAINBOW CONNECTION NUMBERS ON CORONA PRODUCT OF PATH AND COMPLETE GRAPHS. Jurnal Matematika UNAND, 14(4), 376–389. https://doi.org/10.25077/jmua.14.4.376-389.2025

Issue

Vol. 14 No. 4 (2025)

Section

Articles

License

Copyright (c) 2025 Departemen Matematika dan Sains Data FMIPA UNAND

Creative Commons License

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.