کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10118320 | 1632849 | 2005 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Coloring of distance graphs with intervals as distance sets
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Coloring of distance graphs with intervals as distance sets Coloring of distance graphs with intervals as distance sets](/preview/png/10118320.png)
چکیده انگلیسی
Let D be a set of positive integers. The distance graph G(Z,D) with distance set D is the graph with vertex set Z in which two vertices x,y are adjacent if and only if |xây|âD. The fractional chromatic number, the chromatic number, and the circular chromatic number of G(Z,D) for various D have been extensively studied recently. In this paper, we investigate the fractional chromatic number, the chromatic number, and the circular chromatic number of the distance graphs with the distance sets of the form Dm,[k,kâ²]={1,2,â¦,m}â{k,k+1,â¦,kâ²}, where m, k, and kâ² are natural numbers with mâ¥kâ²â¥k. In particular, we completely determine the chromatic number of G(Z,Dm,[2,kâ²]) for arbitrary m, and kâ².
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 26, Issue 8, November 2005, Pages 1216-1229
Journal: European Journal of Combinatorics - Volume 26, Issue 8, November 2005, Pages 1216-1229
نویسندگان
Peter Che Bor Lam, Wensong Lin,