轮和路的广义Mycielski图的星全染色  

Star total coloring of generalized Mycielski's graphs with wheels and paths

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

机构地区：[1]兰州交通大学数理与软件工程学院,甘肃兰州730070 [2]华东交通大学基础课部,江西南昌310000

出　　处：《兰州理工大学学报》2008年第4期145-147,共3页Journal of Lanzhou University of Technology

基　　金：国家自然科学基金(10661007,10771091);甘肃省研究生导师基金(0604-05)

摘　　要：图G的一个正常全染色被称作G的星全染色,如果G中任意路长为2的点和边着色均不相同.图的全部星k-全着色中最小的数k称为它的星全色数.讨论轮和路的广义Mycielski图的星全染色问题,得到不同情况下它们的星全色数,其中每个点的色集合包含该点及其关联边的颜色.A k-proper total coloring of graph G was called the star total coloring of G, if the vertices and edges of any path of length 2 in G were all different, the minimum number of k spanning over all k-star-total-colorings of G was called the star total chromatic number of G. The problem of star total coloring of generalized Mycielski＇s graphs with wheels and paths was discussed and their star total chromatic numbers were obtained in different situations, where the chromatic set of every vertex included the colors of this vertex proper and its incident edges

关 键 词：轮 路 广义MYCIELSKI图 星全色数 

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