On Rainbow Coloring of Some Classes of Graphs
N. Ramya, K. Rangarajan, R. Sattanathan · 2012
A path in an edge colored graph is said to be a rain bow 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 paper a rainbow coloring of the corona of Pn οK2the corona of PnºC4,flower graphs and fan graph are considered and rc(G) of these graphs are decided.