A Note on Chromatic Sum

2008/02/13 by Meysam Alishahi, Alishahi, Meysam, Ali Taherkhani +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.0802.1936

arxiv created 2009/01/24 · arxiv updated 2009/12/01

Abstract

The chromatic sum Σ(G) of a graph G is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present Σ(G)<χ_f(G)|G| for every graph G.

Related

• Coloring Sums of Extensions of Certain Graphs
• Coloring of Trees with Minimum Sum of Colors
• The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs
• On sum edge-coloring of regular, bipartite and split graphs