| Sm ∨ Pn的邻强边染色 |
| |
| 引用本文： | 张玉栋,郝自军,晁福刚,何尚录,张忠辅.Sm ∨ Pn的邻强边染色[J].西安交通大学学报,2006,40(12). |
| |
| 作者姓名： | 张玉栋 郝自军 晁福刚 何尚录 张忠辅 |
| |
| 作者单位： | 1. 兰州交通大学数理与软件工程学院,730070,兰州
2. 兰州交通大学数理与软件工程学院,730070,兰州西北;第二民族学院信息,计算科学系,750000,银川 |
| |
| 摘 要： | 为了解决图的邻强边染色问题中一个图的色数算法问题,通过特别的方法来记图的染色过程,同时分4种情况讨论了星和路联图的邻强边染色问题,指出在染色过程中给定的4种情况的染色方法各不相同,并通过对图的着色得到了星和路联图的邻强边色数.
|
| 关 键 词： | 星 路 联图 邻强边色数 |
Adjacent Strong Edge Chromatic Number of Sm ∨ Pn |
| |
| Zhang Yudong,Hao Zijun,Chao Fugang,He Shanglu,Zhang Zhongfu.Adjacent Strong Edge Chromatic Number of Sm ∨ Pn[J].Journal of Xi'an Jiaotong University,2006,40(12). |
| |
| Authors: | Zhang Yudong Hao Zijun Chao Fugang He Shanglu Zhang Zhongfu |
| |
| Abstract: | To resolve the algorithm of the chromatic number of a graph,a special method is adopt to remember the coloring process of graph,and the method does different jobs for four given cases during the coloring process.The adjacent strong edge chromatic number of join graph of star and path is obtained. |
| |
| Keywords: | star path join graph adjacent strong edge chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
