星图和扇图的广义Mycielski图的星全染色  

On the Star Total Coloring of General Mycielski′s Graphs of the Star Graph and the Fan Graph

作　　者：强会英[1] 李沐春[1] 张忠辅[1,2] 

机构地区：[1]兰州交通大学数理与软件工程学院,甘肃兰州730070 [2]西北师范大学数学与信息科学学院,甘肃兰州730070

出　　处：《江西师范大学学报（自然科学版）》2009年第3期306-308,356,共4页Journal of Jiangxi Normal University(Natural Science Edition)

基　　金：国家自然科学基金(10771091);甘肃省教委基金(0604-05)资助项目

摘　　要：图G的一个正常全染色被称作G的星全染色,如果G中任意路长为2的点和边着色均不相同,则称它为图G的星K-全着色.图的全部星K-全着色中最小的数K称为它的星全色数.讨论了星图和扇图的广义Mycielski图的星全染色问题,得到了不同情况下它们的星全色数,其中每个点的色集合包含该点及其关联边的颜色.A k-proper total coloring of graph G is called the star total coloring of G, if the Coloring of the vertices and edges of any path of length 2 in G are all different, the least number of k spanning over all k-star-total-colorings of G is called the star total chromatic number of G. In this paper, the star total chromatic numbers of general Mycielski＇s graphs of star graphs and fan graphs are searched at the different situations, and obtained the star total chromatic numbers of them. Where the set of every vertex includes the colors of the vertex and its incident edges.

关 键 词：星图 扇图 广义MYCIELSKI图 星全染色 

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