آمار
| تعداد نشریات | 7 |
| تعداد شمارهها | 47 |
| تعداد مقالات | 308 |
| تعداد مشاهده مقاله | 364,409 |
| تعداد دریافت فایل اصل مقاله | 244,991 |
The locating-chromatic number for Halin graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقاله 1، دوره 2، شماره 1، تابستان 2017، صفحه 1-9 اصل مقاله (397 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2017.13577 | ||
| نویسندگان | ||
I.A. Purwasih1؛ Edy T. Baskoro  1؛ H. Assiyatun1؛ D. Suprijanto1؛ M. Baca2
| ||
| 1Institut Teknologi Bandung | ||
| 2Technical University in Koˇsice | ||
| چکیده | ||
| Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) be an ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locating coloring of G. The locating-chromatic number of G, denoted by χL(G), is the least number k such that G admits a locating coloring with k colors. In this paper, we determine the locating-chromatic number of Halin graphs. We also give the locating-chromatic number of Halin graphs of double stars. | ||
| کلیدواژه ها | ||
| locating-chromatic number؛ Halin؛ double star | ||
|
آمار تعداد مشاهده مقاله: 846 تعداد دریافت فایل اصل مقاله: 789 |
||
