The (Strong) Rainbow Connection Number of Join Of Ladder and Trivial Graph

Dinda Kartika, Didi Febrian, Nurul Maulida Surbakti


Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can be considered as a rainbow k-coloring if every two vertices x and y in G has an x- y path. Therefore, no two path's edges receive the same color; this condition is called a “rainbow path”. The smallest positive integer k, designated by rc(G), is the G rainbow connection number. Thus, G has a rainbow k-coloring. Meanwhile, the c function is considered as a strong rainbow k-coloring within the condition for every two vertices x and y in G have an x - y rainbow path whose length is the distance between x and y. The smallest positive integer k, such as G, has a strong rainbow k-coloring; such a condition is called a strong rainbow connection number of G, denoted by src(G). In this research, the rainbow connection number and strong rainbow connection number are determined from the graph resulting from the join operation between the ladder graph and the trivial graph, denoted by rc(L_n∨K_1) and src(L_n∨K_1) respectively. So, rc (L_n∨K_1 )= src (L_n∨K_1 )=2,"for" 3≤n≤4 and rc (L_n∨K_1 )=3, while src(L_n∨K_1 )=⌈n/2⌉,"for" n≥5.



Rainbow path; Ladder graph; Join; Rainbow connection number;

Full Text:



Basavaraju, M., Chandran, L. S., Rajendraprasad, D., & Ramaswamy, A. (2014). Rainbow Connection Number of Graph Power and Graph Products. Graphs and Combinatorics, 30(6), 1363–1382.

Chartrand, G., Johns, G. L., Mckeon, K. A., & Zhang, P. (2008). Rainbow connection in graphs. Mathematica Bohemica, 127(1), 85–98.

Chen, L., Li, X., Liu, H., & Liu, J. (2018). On various (strong) rainbow connection numbers of graphs. Australasian Journal of Combinatorics, 70(1), 137–156.

Chen, X., Li, X., Wang, J., & Fan, N. (2019). The rainbow connectivity of cartesian product graphs. Journal of Discrete Mathematical Sciences and Cryptography, 22(6), 901–914.

Dafik, D., Agustin, I. H., Wardanai, D. A. R., Kurniawati, E. Y., & Alfarisi, R. (2018). On the Rainbow and Strong Rainbow Coloring of Comb Product Graphs. Acta Mechanica Slovaca, 22(3), 20–26.

Diestel, R. (2005). Graph Theory. Springer.

Doan, T. D., Ha, P. H., & Schiermeyer, I. (2022). The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs. Graphs and Combinatorics, 38(5). DOI: 10.1007/s00373-022-02567-y

Fitrianda, S., Yulianti, L., & Narwen. (2018). Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf Tangga Segitiga yang Diperumum. Jurnal Matematika UNAND, VII(1), 136–142.

Fitriani, D., & Salman, A. N. M. (2016). Rainbow connection number of amalgamation of some graphs. AKCE International Journal of Graphs and Combinatorics, 13(1), 90–99.

Gembong, A. W., & Agustin, I. H. (2017). The Rainbow ( 1 , 2 ) -Connection Number of Edge Comb Product Graph and It ’ s Lower Bound. 2, 5–6. ISBN: 978-602-60569-5-5

Gologranc, T., Mekiš, G., & Peterin, I. (2014). Rainbow Connection and Graph Products. Graphs and Combinatorics, 30(591–607).

Kartika, D. (2020). Indeks Pelangi-3 Kuat Graf Hasil Operasi Kali Sisir Titik Graf Tangga Dengan Graf Bintang (L_n ⊳∘ K_(1,r)). Karismatika, 6(3), 1–9.

Li, H., Li, X., & Liu, S. (2011). The ( strong ) rainbow connection numbers of Cayley graphs on. Computers and Mathematics with Applications, 62(11), 4082–4088.

Li, H., & Ma, Y. (2017). Rainbow connection number and graph operations. Discrete Applied Mathematics, 230, 91–99.

Li, X., & Sun, Y. (2012). Rainbow Connections of Graphs: A Survey. In Graphs and Combinatorics (Vol. 29, Issue 1). SpringerBriefs in Math.Springer.

Liu, Y. (2014). The Rainbow Connection of Windmill and Corona Graph. 8(128), 6367–6372.

Maulani, A., Pradini, S. F. Y. O., Setyorini, D., Sugeng, K. A., Indonesia, F. U., & Ui, K. (2019). Rainbow connection number of C_m⊙P_n and C_m⊙C_n. 3(2), 95–108.

Morris, R., & Thompson, K. (1979). Password Security: A Case History. Communications of the ACM, 22(11): 594-597.

Resty, D., & Salman, A. N. M. (2015). The Rainbow Connection Number of an n-Crossed Prism Graph and its Corona Product with a Trivial Graph. Procedia Computer Science, 74, 143–150.

Schiermeyer, I. (2011). Bounds For The Rainbow Connection. Discussiones Mathematicae, 31, 387–395.

Septyanto, F., & Sugeng, K. A. (2017). Rainbow connections of graph joins. Australasian Journal of Combinatorics, 69(3), 375–381. ISSN: 2202-3518

Shulhany, M. A., & Salman, A. N. M. (2016). The (strong) rainbow connection number of stellar graphs. AIP Conference Proceedings, 1708(February 2016).

Zhang, L., Tan, C., & Yu, F. (2013). An Improved Rainbow Table Attack for Long Passwords. Procedia Computer Science, 107(2017), 47-52.



  • There are currently no refbacks.

Copyright (c) 2023 Dinda Kartika, Didi Febrian, Nurul Maulida Surbakti

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.


JTAM already indexing:




Creative Commons License

JTAM (Jurnal Teori dan Aplikasi Matematika) 
is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License




JTAM (Jurnal Teori dan Aplikasi Matematika) Editorial Office: