University of Mohaghegh Ardabili Journal of Hyperstructures 2251-8436 5 1 2016 06 01 On harmonious chromatic number of triple star graph 26 32 2651 10.22098/jhs.2016.2651 EN Akhlak Mansuri Department of Mathematics, Lakshmi Narain College Of Technology (LNCT, Bhopal), Kalchuri Nagar, Raisen Road, Bhopal-462021, India Journal Article 2014 06 06 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. https://jhs.uma.ac.ir/article_2651_3d7dbbe6571d6251ecf5ae4c655510dd.pdf