A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is rainbow connected if there exists a rainbow path between every pair of vertices. The rainbow connectivity of a graph G, denoted by rc(G) is the smallest number of colors required to edge color the graph such that the graph is rainbow connected.In this note, we determine the exact values of rc (G • H) where G or H are complete graph K n , path P n , tree T n , or wheel W n with n is an integer. Mathematics Subject Classification: 05C15, 05C40