Harmonious coloring of central graphs of certain snake graphs
M. S. Franklin Thamil Selvi · Applied Mathematical Sciences · 2015
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A harmonious coloring of a simple graph is the proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number of G, denoted by χh (G), is the least number of colors in a harmonious coloring of G. The paper gives the structural properties and the estimates of harmonious chromatic number of central graphs of Triangular snake graph C [Tn], Double triangular snake graph C [D (Tn)] and Diamond snake graph C [Dn].