Certain chromatic sums of some cycle-related graph classes
Sudev Naduvath, K. P. Chithra, Johan Kok · Discrete Mathematics Algorithms and Applications · 2016
Let [Formula: see text] be a certain type of proper [Formula: see text]-coloring of a given graph [Formula: see text] and [Formula: see text] denote the number of times a particular color [Formula: see text] is assigned to the vertices of [Formula: see text]. Then, the coloring sum of a given graph [Formula: see text] with respect to the coloring [Formula: see text], denoted by [Formula: see text] is defined to be [Formula: see text]. The coloring sums such as [Formula: see text]-chromatic sum, [Formula: see text]-chromatic sum, [Formula: see text]-chromatic sum, [Formula: see text]-chromatic sum, etc. are some of these types of coloring sums that have been studied recently. Motivated by these studies on certain chromatic sums of graphs, in this paper, we study certain chromatic sums for some standard cycle-related graphs.