Rainbow Connection Number in the Brick Product Graphs C(2n,m, r)

All graphs considered in this paper are simple, finite and undirected. Let G be a nontrivial connected graph with an edge coloring c : E(G) → {1, 2, · · · , k}, k ∈ N, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same