Rainbow connection number of k-corona product of graphs
Rica Amalia, Siti Nor Arifah · AIP conference proceedings · 2024
Let G be a nontrivial connected graph. A rainbow path is a path where each edge has different color. A rainbow coloring is a coloring which any two vertices can be joined by at least one rainbow path. A rainbow connection number of a graph, denoted by rc(G), is the smallest number of color required for graph G to be rainbow connected. In this paper, we determine the rainbow connection number of k-corona product of graphs. We get rc(GʘkH) = rc(G) + 3k for any integer k ≥ 1 and G and H are nontrivial connected graphs.