Irregular coloring of Join of two graphs and Platonic graphs

A proper coloring c of a graph G is an assignment of colors to the vertices of G in such a way that no two adjacent vertices will get the same color. The coloring c is irregular if every vertex in G has different color codes. The minimum number of colors needed to obtain an irregular coloring is the irregular chromatic number. In this paper we study the irregular chromatic number of Join of graphs and Platonic graphs.