A rainbow path in a graph is an edge colored graph such that each edge in the path does
not have the same color. The minimal number of colors which is needed to color the edges
in the path so that every pair of vertices is connected by at least one rainbow path is called
the rainbow connection number of, denoted by (). A rainbow path of length (,), where (,) is
the distance between and, is called rainbow uv geodesic in. A strongly rainbow connected
graph is a graph such that there exists a rainbow− geodesic for any two vertices and in. The …