On harmonious coloring of total graphs of c(cn), c(k1,n) and c(pn)

• Vivin J., Vernold ^[1] ; Ali. M. M., Akbar ^[1] ; Kaliraj, K ^[2]
  1. [1] Sri Shakthi Institute of Engineering and Technology.
  2. [2] R. V. S. College of Engineering and Technology.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 29, Nº. 1, 2010, págs. 57-76
• Idioma: inglés
• DOI: 10.4067/S0716-09172010000100007
• Enlaces
  • Texto completo
• Resumen

  • In this paper, we present the structural properties of total graph of central graph of cycles Cn, star graphs K1,n and paths Pn denoted by T (C(Cn)), T (C(K1,n)) and T (C(Pn)) respectively. We mainly focus our discussion on the harmonious chromatic number of T (C(Cn)), T (C(K1,n)) and T (C(Pn)).

• Referencias bibliográficas
  • Citas J. A. Bondy and U.S.R. Murty, Graph theory with Applications, London: MacMillan, (1976).
  • Keith Edwards. A Bibliography of Harmonious Colorings and Achromatic Number. http://www.computing.dundee.ac.uk/sta/kedwards/biblio.html, (2009).
  • Frank Harary, Graph Theory, Narosa Publishing home, (1969).
  • J.Hopcroft and M.S. Krishnamoorthy, On the harmonious coloring of graphs, SIAM J. Algebra Discrete Math 4, pp. 306-311, (1983).
  • Marek Kubale, Graph Colorings, American Mathematical Society Providence, Rhode Island, (2004).
  • Vernold Vivin. J, Ph.D Thesis, Harmonious Coloring of Total Graphs, n−Leaf, Central graphs and Circumdetic Graphs, Bharathiar University,...
  • Vernold Vivin. J and Akbar Ali.M.M, On Harmonious Coloring of Middle graph of C(Cn), C(K1,n) and C(Pn), Note di Matematica Vol.(29) 2, pp....