A Study on Harmonious Coloring of Circulant Networks
About this article
Abstract
Given a simple graph , a harmonious coloring of is the proper vertex coloring such that each pair of colors seems to appears together on at most one edge. The harmonious chromatic number of , denoted by is the minimal number of colors in a harmonious coloring of . In this paper we have determined the harmonious chromatic number of some classes of Circulant Networks.
References
[1] Asdre K, Ioannidou K and Nikolopoulos S. D, “The harmonious coloring problem is NP-Complete for interval and permutation graphs”, Discrete Applied Math, vol. 155, (2007), pp. 2377-2382.
[2] Campbell D and Edwards K. J, “A new lower bound for the har-monious chromatic number”, Australasian Journal of Combinatorics, vol.29, (2004), pp. 99–102.
[3] K. J. Edwards and C. J. H. Diarmid, “The complexity of harmoni-ous coloring for trees”, Discrete Applied Math, vol.57, (1995), pp.133-144.
[4] K. J. Edwards and C. J. H. Diarmid, “New upper bounds on har-monious coloring”, Journal Of Graph Theory, Vol. 18, (1994), pp. 257-267.
[5] Paul Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel, “Tree Spanners, Cayley Graphs and Diametrically Uniform Graphs”, LNCS,vol. 2880, (2003) pp.334-345.