A Study on Harmonious Coloring of Circulant Networks
DOI:
https://doi.org/10.14419/ijet.v7i4.10.20945Keywords:
Circulant Network, Diameter, Diametrically uniform graph, Harmonious coloring, Matching,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 harmonious chromatic numberâ€, Australasian Journal of Combinatorics, vol.29, (2004), pp. 99–102.
[3] K. J. Edwards and C. J. H. Diarmid, “The complexity of harmonious 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 harmonious 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.
Downloads
How to Cite
Received date: October 4, 2018
Accepted date: October 4, 2018
Published date: October 2, 2018