Harmonious Coloring of Comb Graph

Graph coloring is one of the effective methods that addresses numerous problems in graph theory. Harmonious coloring has a potential application in Network Analysis, Telecommunications, Airspace, Medical Research Centers and Radio Navigation Systems that tell of bad weather conditions and clustering. Harmonious coloring is the graph where any two adjacent vertices receive different colors and also a unique color pair of vertices on every edge. In Harmonious coloring, the lowest number of colors is termed as Harmonious chromatic number and it is symbolized as image.png(G). This paper shows the Harmonious chromatic number of the Comb Graph image.png and complement and also its Central Graph Cimage.png).