On harmonious chromatic number of triple star graph

A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious coloring of G and it is denoted byXH(G).The purpose of this paper is to extend the double star graph [12] and to discuss harmonious coloring for central graph, middle graph and total graph of extended double star graph i.e. triple star graph.