A note on chromatic blending of colour clusters

For a colour cluster $\C =($\mathcal{C}$_1,$\mathcal{C}$_2, $\mathcal{C}$3,\dots,$\mathcal{C}$\ell)$,$$\mathcal{C}$_i$isacolourclass,and$|$\mathcal{C}$_i|=r_i \geq 1$,weinvestigateasimpleconnectedgraphstructure$G^{\C}$, which represents a graphical embodiment of the colour cluster such that the chromatic number $\chi (G^{\text{C}})=\mathrm{\ell },$ and the number of edges is a maximum, denoted ${\epsilon }^{+}(G^{\text{C}})$. We also extend the study by inducing new colour clusters recursively by blending the colours of all pairs of adjacent vertices. Recursion repeats until a maximal homogeneous blend between all $\mathrm{\ell }$ colours is obtained. This is called total chromatic blending. Total chromatic blending models for example, total genetic, chemical, cultural or social orderliness integration.