The harmonious chromatic number of a graph G, denoted by h(G), is the leastnumber of colors needed to color the vertices of G in such a way that adarent verticesare colored by different colors and any two distinct edg...
Let the chromatic number of G, the edge chromatic number of G and thetotal chromatic number of G be denoted by x(G), x1(G) and x2(G), respectively. Forany simple graph G of order p and its ...