| 完全二部图的Mycielski图的点可区别全色数 |
| |
| 引用本文： | 徐文辉,张婷,张忠辅.完全二部图的Mycielski图的点可区别全色数[J].兰州铁道学院学报,2008,27(6). |
| |
| 作者姓名： | 徐文辉 张婷 张忠辅 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院 |
| |
| 基金项目： | 国家自然科学基金资助项目
|
| |
| 摘 要： | 图的一个正常的全染色如果满足不同点的点及其关联边的色集合不同,则称该染色法为点可区别全染色,其所用最少颜色数称为该图的点可区别全色数.给出了完全二部图的Mycielski图的点可区别全色数.
|
| 关 键 词： | 完全二部图 Mycielski图 点可区别全色数 |
Vertex-distinguishing Total Chromatic Number of Mycielski's Graph of Complete Bipartite Graph |
| |
| XU Wen-hui,ZHANG Ting,ZHANG Zhong-fu.Vertex-distinguishing Total Chromatic Number of Mycielski's Graph of Complete Bipartite Graph[J].Journal of Lanzhou Railway University,2008,27(6). |
| |
| Authors: | XU Wen-hui ZHANG Ting ZHANG Zhong-fu |
| |
| Abstract: | A proper total coloring of a graph is called vertex-distinguishing total coloring if any two vertices have different color sets,where the color set of a vertex is the set composed of all colors of the vertex and the edges incidental to it.The minimum number of colors of a vertex-distinguishing total coloring is called the vertex-distinguishing total chromatic number of the graph.In this paper,we obtained the vertex-distinguishing total chromatic number of Mycielski's graph of complete bipartite graph. |
| |
| Keywords: | complete bipartite graph Mycielski graph vertex-distinguishing total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
