The Rainbow Connection Number of a Flower (Cm, Kn) Graph and a Flower (C3, Fn) Graph

An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path. The smallest number of colors needed in order to make G rainbow connected is called the rainbow connection number of G, denoted by rc(G). In this paper, we determine the rainbow connection number of a flower (Cm, Kn) and a flower (C3, Fn) graph.