Coloring Sums of Extensions of Certain Graphs

2016/02/01 by Johan Kok, Kok, Johan, Saptarshi Bej +1
Mathematics · #FOS: Mathematics #General Mathematics (math.GM) #math.GM

paper · pdf · doi:10.48550/arxiv.1602.03735

12 pages

arxiv created 2016/02/01 · arxiv updated 2016/02/12

Abstract

Recall that the minimum number of colors that allow a proper coloring of graph G is called the chromatic number of G and denoted by χ(G). In this paper the concepts of χ'-chromatic sum and χ⁺-chromatic sum are introduced. The extended graph G^x of a graph G was recently introduced for certain regular graphs. We further the concepts of χ'-chromatic sum and χ⁺-chromatic sum to extended paths and cycles. The paper concludes with patterned structured graphs.

Related

• A Note on Chromatic Sum
• On sum edge-coloring of regular, bipartite and split graphs
• A study on edge coloring and edge sum coloring of integral sum graphs
• The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
• Chromatic Completion Number