Graph coloring is an assignment of colors, labels or weights to the elements of graphs subject to certain conditions. Coloring the vertices of a graph G such that adjacent vertices possessing different colors is the notion of proper coloring. A proper coloring C of a graph G is called an injective coloring of G if any two vertices of G having the same neighbouring vertex have different colors in C. As a coloring analogue to Zagreb indices and irregularity indices in the literature, chromatic Zagreb and irregularity indices have been introduced very recently. In this paper, we introduce the notion of injective chromatic Zagreb indices and injective chromatic irregularity indices and determine these indices for some standard classes of graphs.
Keywords and Phrases
Chromatic Zagreb indices, irregularity indices, injective Chromatic Zagreb indices, injective irregularity indices.
A.M.S. subject classiﬁcation