Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
