In recent years, the notion of chromatic Zagreb indices has been introduced and studied for certain basic graph classes, as a coloring parallel of different Zagreb indices. A proper coloring \C of a graph G, which assigns colors to the vertices of G such that the numbers of vertices in any two color classes differ by at most one, is called an equitable coloring of G. In this paper, we introduce the equitable chromatic Zagreb indices and equitable chromatic irregularity indices of some special classes of graphs called Mycielski graphs of paths and cycles.






Additional Information


 Rose, Smitha, Naduvath, Sudev