Research Article
On Rainbow Coloring of Some Classes of Graphs
|
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 |
10.5120/7044-9531
|
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
Abstract
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.
References
- Bollobas, B. 1998. Modern graph theory. Graduate Texts in Mathematics. 184, Springer-Verlag.
- Ramya, N. , Rangarajan, K. and Sattanathan, R. 2011. On coloring of bimagic 4-regular graphs. Int. Journal of Ultra Scientist of Physical Sciences. 23(3).
- Ramya, N. , Rangarajan, K. and Sattanathan, R. 4-regular graphs and its prime labeling. IJCGTA. Accepted for Publication.
- Ramya, N. , Rangarajan, K and Sattanathan, R. 2012. Edge magic labeling of some graphs. Proc. Nat. Conf. (NCMTA-2012), 258?262.
- Ramya. N. , Rangarajan. K. and Sattanathan. R. 2012. Edge magic and anti magic labeling of regular graphs. Proc. of ICMEB-2012.
- Chartand, G. , Johns, G. L. , Mckeon, K. and Zlang, P. 2008. Rainbow connection in graphs. Math. Bohem. 133, 85?98.
- Krivelvich, M. and Yuster, R. (2010), The rainbow connection of a graph is (atmost) reciprocal to its minimum degree. J. Graph Theory. 63, 185-91.
- Basavaraju, M. Chandran, L. S. , Rajendra Prasad, D. and Ramaswamy, A. , Rainbow connection number and radious, arXiv:1011. 0621v1[math. co].
- Prabha, R. and Indra Rajasingh. 2012, Rainbow coloring of crown graphs, Proceedings of ICMEB 2012.
- Chakraborty, S. , Fischer, E. , Matsliah, A. R. and Yuster, R 2009, Hardness and algorithms for rainbow connection, J. Combin. Optimization, 1?18.
- Ericksen, A. 2007, A matter of security. Graduating Engineer & Computer Carrers, 24?28.
- Kaladevi, V. and Kavitha, G. 2012, Edge-odd graceful labeling of some corona graphs, Proceedings of ICMEB.
- Ramya, N. , Rangarajan, K. and Sattanathan, R. 2012, On Prime labeling of some classes of graphs, IJCA, Volume44-No. 4 April 2012.
- Vasanthi, B and Sattanathan, R. 2011, Graceful labeling of sunflower graphs, Proceedings of ICMCS.
Index Terms
Keywords