International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 46 - Issue 18 |
Published: May 2012 |
Authors: N. Ramya, K. Rangarajan, R. Sattanathan |
![]() |
N. Ramya, K. Rangarajan, R. Sattanathan . On Rainbow Coloring of Some Classes of Graphs. International Journal of Computer Applications. 46, 18 (May 2012), 36-38. DOI=10.5120/7044-9531
@article{ 10.5120/7044-9531, author = { N. Ramya,K. Rangarajan,R. Sattanathan }, title = { On Rainbow Coloring of Some Classes of Graphs }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 46 }, number = { 18 }, pages = { 36-38 }, doi = { 10.5120/7044-9531 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A N. Ramya %A K. Rangarajan %A R. Sattanathan %T On Rainbow Coloring of Some Classes of Graphs%T %J International Journal of Computer Applications %V 46 %N 18 %P 36-38 %R 10.5120/7044-9531 %I Foundation of Computer Science (FCS), NY, USA
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.