|
|||||
|
|
| 轮和路的广义Mycielski图的星全染色 | |
| 引用本文： | 强会英,李沐春,徐保根,张忠辅.轮和路的广义Mycielski图的星全染色[J].兰州理工大学学报,2008,34(4). |
| 作者姓名： | 强会英 李沐春 徐保根 张忠辅 |
| 作者单位： | 1. 兰州交通大学,数理与软件工程学院,甘肃,兰州,730070 2. 华东交通大学,基础课部,江西,南昌,310000 3. 兰州交通大学,数理与软件工程学院,甘肃,兰州,730070;西北师范大学,数学与信息科学学院,甘肃,兰州,730070 |
| 基金项目： | 国家自然科学基金，甘肃省研究生导师基金 |
| 摘 要： | 图G的一个正常全染色被称作G的星全染色,如果G中任意路长为2的点和边着色均不相同.图的全部星k-全着色中最小的数k称为它的星全色数.讨论轮和路的广义Mycielski图的星全染色问题,得到不同情况下它们的星全色数,其中每个点的色集合包含该点及其关联边的颜色. |
| 关 键 词： | 轮 路 广义Mycielski图 星全色数 |
Star total coloring of generalized Mycielski's graphs with wheels and paths |
|
| QIANG Hui-ying,LI Mu-chun,XU Bao-geng,ZHANG Zhong-fu.Star total coloring of generalized Mycielski''''s graphs with wheels and paths[J].Journal of Lanzhou University of Technology,2008,34(4). | |
| Authors: | QIANG Hui-ying LI Mu-chun XU Bao-geng ZHANG Zhong-fu |
| Abstract: | 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 |
| Keywords: | wheel path generalized Mycielski graphs star total coloring |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |