|
|
|
|
MODULAR CHROMATIC NUMBER OF CmPn
|
|
|
|
|
|
|
|
نویسنده
|
سامپاته کومار ر. ,پاراماگورو ن.
|
|
منبع
|
transactions on combinatorics - 2013 - دوره : 2 - شماره : 2 - صفحه:47 -72
|
|
چکیده
|
A modular k-coloring, k 2; of a graph g is a coloring of the vertices of g with theelements in zk having the property that for every two adjacent vertices of g; the sums of the colorsof their neighbors are different in zk: the minimum k for which g has a modular k-coloring is themodular chromatic number of g: except for some special cases, modular chromatic number of cmpnis determined.
|
|
کلیدواژه
|
modular coloring ,modular chromatic number ,Cartesian product
|
|
آدرس
|
Annamalai University, Mathematics Section, Faculty of Engineering and Technology, Annamalai University, Annamalainagar-608 002, India, India, Annamalai University, Mathematics Wing, Directorate of Distance Education, Annamalai University, Annamalainagar-608 002, India, India
|
|
پست الکترونیکی
|
npguru@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|