若干笛卡尔积图的星全染色  

The Star Total Coloring of Cartesian Product of Some Graphs

作　　者：马庆媛[1] 田双亮[1] 

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730030

出　　处：《云南民族大学学报（自然科学版）》2011年第3期202-203,共2页Journal of Yunnan Minzu University:Natural Sciences Edition

基　　金：国家民委社科基金(08XB07)

摘　　要：图G的一个正常全染色如果满足G中任意路长为2的点和边着色均不相同时,称为G的星全染色.图的全部k-星全染色中所用最少的颜色数称为图G的星全色数.得到了路与星、轮、扇的笛卡尔积图的星全色数.A k - proper total coloring of graph G is called the star total coloring of G. If the vertices and edges of any path of the length of two have receiVed distinct colors, the minimum number of k spanning overall k - star - to- tal -colorings of G is called the star total chromatic number of G. This paper has obtained the star total chromatic number of the Cartesian product of path and star, wheel and fan.

关 键 词：笛卡尔积图 星全染色 星全色数 

分 类 号：O157.5[理学—数学]