| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514560 | Electronic Notes in Discrete Mathematics | 2005 | 6 Pages |
Abstract
A distance graph (resp. circulant graph) is a graph obtained from the path (resp. the cycle) of order n by adding chordal edges between any pair of vertices at distance dâD, with DâZn. The chromatic sum of a graph is the smallest sum of colors among all proper colorings of this graph. This paper studies the chromatic sum for some classes of distance graphs and circulant graphs depending on the value of D.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Brice Effantin, Hamamache Kheddouci,