Modular chromatic number of C_m \square P_n
عنوان مقاله: Modular chromatic number of C_m \square P_n
شناسه ملی مقاله: JR_COMB-2-2_007
منتشر شده در در سال 1392
شناسه ملی مقاله: JR_COMB-2-2_007
منتشر شده در در سال 1392
مشخصات نویسندگان مقاله:
N. Paramaguru - Annamalai University
R. Sampathkumar - Annamalai University
خلاصه مقاله:
N. Paramaguru - Annamalai University
R. Sampathkumar - Annamalai University
A modular k\!-coloring, k\ge ۲, of a graph G is a coloring of the vertices of G with the elements in \mathbb{Z}_k having the property that for every two adjacent vertices of G, the sums of the colors of their neighbors are different in \mathbb{Z}_k. The minimum k for which G has a modular k\!-coloring is the modular chromatic number of G. Except for some special cases, modular chromatic number of C_m\square P_n is determined.
کلمات کلیدی: modular coloring, modular chromatic number, Cartesian product
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1319429/