On irregular colorings of double wheel graph families
A. Rohini, Mathiyazhagan Venkatachalam · Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics · 2018
An assignment of colors to the vertices of a graph, so that no two adjacent vertices get the same color is called a proper coloring. An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbours. In this paper, we investigate the irregular chromatic number for the middle graph, total graph, central graph and line graph of double wheel graph.