Generalized rainbow connection of graphs (Q2239021)

A path in an edge-colored graph with no two edges sharing the same color is called a rainbow path. A graph $G$ with an edge-coloring is said to be rainbow connected if every pair of distinct vertices of $G$ is connected by at least one rainbow path in $G$. A graph $G$ is called $(k,l)$-rainbow connected if every pair of distinct vertices of $G$ are connected by $k$ pairwise internally vertex-disjoint $l$-rainbow paths in $G$. The authors obtain an upper bound for the (1, 2)-rainbow connection numbers in 2-connected graphs. The (1, 2)-rainbow connection numbers of graphs are obtained by some graph operations including the joins of graphs, Cartesian, strong and lexicographic products of graphs, the cube and permutation graphs.