ON IRREGULAR COLORINGS OF DOUBLE WHEEL GRAPH FAMILIES

Abstract

An assignment of colors to the vertices of a graph, so that no twoadjacent vertices get the same color is called a proper coloring. An irregularcoloring of a graph is a proper vertex coloring that distinguishes vertices in thegraph either by their own colors or by the colors of their neighbours. In thispaper, we investigate the irregular chromatic number for the middle graph,total graph, central graph and line graph of double wheel graph.