On harmonious coloring of total graphs of c(cn), c(k1,n) and c(pn)
Keywords:Central graph, total graph, harmonious coloring, grafo central, grafo total, coloreado armonioso.
AbstractIn 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)).
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, (2007).
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. 203-214, (2009).
How to Cite
Copyright (c) 2010 Proyecciones. Journal of Mathematics
This work is licensed under a Creative Commons Attribution 4.0 International License.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.