Local strong rainbow connection number of corona product between cycle graphs

Khairunnisa N. Afifah, Kiki A. Sugeng


A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called d-local strong rainbow coloring. The d-local strong rainbow connection number, denoted by lsrcd(G), is the least number of colors used in d-local strong rainbow coloring. Suppose that G and H are graphs of order m and n, respectively. The corona product of G and H, ⊙ H, is defined as a graph obtained by taking a copy of G and m copies of H, then connecting every vertex in the i-th copy of H to the i-th vertex of G. In this paper, we will determine the lsrcd(CmCn) for d=2 and d=3.


local strong rainbow coloring, local strong rainbow connection number, corona product, cycle graph

Full Text:


DOI: http://dx.doi.org/10.19184/ijc.2023.7.1.4


G. Chartrand, L. Lesniak, and P. Zhang, Graphs and digraphs, Fifth Edition, Chapman and Hall/CRC (2010).

A. J. Bondy and U. S. R. Murty, Graph theory with applications, Macmillan, London (1976).

R. Frucht and F. Harary, On the corona of two graphs, Aeq. Math., 4 (1970): 322-325.

G. Chartrand, G. L. Johns, K. A. McKeon, and P. Zhang, Rainbow connection in graphs, Math. Bohem., 133 (2008): 85-98.

A. Maulani, S. Pradini, D. Setyorini, and K. A. Sugeng, Rainbow connection number of Cm ⊙ Pn and Cm ⊙ Cn, Indones. J. Comb., 3 (2020): 95-108.

F. Septyanto and K. A. Sugeng, Distance-local rainbow connection number, Discussiones Math. Graph Theory, 42 (2022): 1027-1039.


  • There are currently no refbacks.

ISSN: 2541-2205

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

View IJC Stats