Open AccessA Study on Harmonious Coloring of Circulant Networks
Author(s) -
M. Selvi,
A. Amutha,
Antony Mary A
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.20945
Subject(s) - circulant matrix , chromatic scale , edge coloring , mathematics , vertex (graph theory) , brooks' theorem , combinatorics , circulant graph , graph coloring , graph , chordal graph , 1 planar graph , line graph , graph power , voltage graph
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.