We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

On Rainbow Coloring of Some Classes of Graphs

by N. Ramya, K. Rangarajan, R. Sattanathan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 46 - Number 18
Year of Publication: 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 },
issue_date = { May 2012 },
volume = { 46 },
number = { 18 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 36-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume46/number18/7044-9531/ },
doi = { 10.5120/7044-9531 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:40:07.310572+05:30
%A N. Ramya
%A K. Rangarajan
%A R. Sattanathan
%T On Rainbow Coloring of Some Classes of Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 46
%N 18
%P 36-38
%D 2012
%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
  1. Bollobas, B. 1998. Modern graph theory. Graduate Texts in Mathematics. 184, Springer-Verlag.
  2. 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).
  3. Ramya, N. , Rangarajan, K. and Sattanathan, R. 4-regular graphs and its prime labeling. IJCGTA. Accepted for Publication.
  4. Ramya, N. , Rangarajan, K and Sattanathan, R. 2012. Edge magic labeling of some graphs. Proc. Nat. Conf. (NCMTA-2012), 258?262.
  5. Ramya. N. , Rangarajan. K. and Sattanathan. R. 2012. Edge magic and anti magic labeling of regular graphs. Proc. of ICMEB-2012.
  6. Chartand, G. , Johns, G. L. , Mckeon, K. and Zlang, P. 2008. Rainbow connection in graphs. Math. Bohem. 133, 85?98.
  7. 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.
  8. Basavaraju, M. Chandran, L. S. , Rajendra Prasad, D. and Ramaswamy, A. , Rainbow connection number and radious, arXiv:1011. 0621v1[math. co].
  9. Prabha, R. and Indra Rajasingh. 2012, Rainbow coloring of crown graphs, Proceedings of ICMEB 2012.
  10. Chakraborty, S. , Fischer, E. , Matsliah, A. R. and Yuster, R 2009, Hardness and algorithms for rainbow connection, J. Combin. Optimization, 1?18.
  11. Ericksen, A. 2007, A matter of security. Graduating Engineer & Computer Carrers, 24?28.
  12. Kaladevi, V. and Kavitha, G. 2012, Edge-odd graceful labeling of some corona graphs, Proceedings of ICMEB.
  13. Ramya, N. , Rangarajan, K. and Sattanathan, R. 2012, On Prime labeling of some classes of graphs, IJCA, Volume44-No. 4 April 2012.
  14. Vasanthi, B and Sattanathan, R. 2011, Graceful labeling of sunflower graphs, Proceedings of ICMCS.
Index Terms

Computer Science
Information Sciences

Keywords

Rainbow Coloring Flower Graph Fan Graph

Powered by PhDFocusTM