On the Edgedifference and Edgesum Chromatic Sum of the Simple Graphs

For a coloring c of a graph g, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring c are respectively ∑c d(g) = ∑ |c(a) − c(b)| and ∑ s s(g) = ∑(c(a) + c(b)), where the summations are taken over all edges ab ∈ e(g). the edge-difference chromatic sum, denoted by ∑ d(g), and the edge-sum chromatic sum, denoted by ∑ s(g), are respectively the minimum possible values of ∑c d(g) and ∑c s(g), where the minimums are taken over all proper coloring of c. in this work, we study the edge-difference chromatic sum and the edge-sum chromatic sum of graphs. in this regard, we present some necessary conditions for the existence of homomorphism between two graphs. moreover, some upper and lower bounds for these parameters in terms of the fractional chromatic number are introduced as well.