A Note on Chromatic Sum
| dc.creator | Alishahi, Meysam | |
| dc.creator | Taherkhani, Ali | |
| dc.date | 2008-02-13 | |
| dc.date | 2009-01-24 | |
| dc.date.accessioned | 2026-07-07T12:33:31Z | |
| dc.date.available | 2026-07-07T12:33:31Z | |
| dc.description | 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$. | |
| dc.identifier | https://arxiv.org/abs/0802.1936 | |
| dc.identifier | http://arxiv.org/abs/0802.1936 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/217154 | |
| dc.subject | Combinatorics | |
| dc.title | A Note on Chromatic Sum | |
| dc.type | text |