Coloring sums of extensions of certain graphs

Abstract

Abstract:We recall that the minimum number of colors that allow a proper coloring of graph G is called the chromatic number of G and denoted χ(G). Motivated by the introduction of the concept of the b-chromatic sum of a graph the concept of χ -chromatic sum and χ + -chromatic sum are introduced in this paper. The extended graph G x of a graph G was recently introduced for certain regular graphs. This paper furthers the concepts of χ -chromatic sum and χ + -chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.2010 MSC: 05C15, 05C20, 05C38, 05C62