| 路与轮联图的邻强边色数 |
| |
| 引用本文： | 马刚,张忠辅.路与轮联图的邻强边色数[J].苏州科技学院学报(自然科学版),2007,24(2):1-4. |
| |
| 作者姓名： | 马刚 张忠辅 |
| |
| 作者单位： | 1. 西北民族大学,计算机科学与信息工程学院,甘肃,兰州,730030
2. 兰州交通大学,应用数学研究所,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金;国家民委科研项目 |
| |
| 摘 要： | 对一个正常的边染色满足相邻点的色集不同的条件时，称为邻强边染色，其所用最少染色数称为邻强边色数。就路与轮的联图，得到了在m,n任意取值情况下的邻强边色数。
|
| 关 键 词： | 路 轮 联图 邻强边色数 |
| 文章编号： | 1672-0687（2007）02-0001-04 |
| 修稿时间： | 2006-05-16 |
On the Adjacent Strong Edge Chromatic Number of Path and Wheel Join-graph |
| |
| MA Gang,ZHANG Zhong-fu.On the Adjacent Strong Edge Chromatic Number of Path and Wheel Join-graph[J].Journal of University of Science and Technology of Suzhou,2007,24(2):1-4. |
| |
| Authors: | MA Gang ZHANG Zhong-fu |
| |
| Institution: | 1.College of Computer Science and Information Engineering, Northwest University for Nationalities, Lanzhou 730030, China;2.Institute of Applied Mathematics, Lanzhou Jiao Tong University, Lanzhou 730070, China |
| |
| Abstract: | A proper edge coloring is called adjacent strong edge coloring if it satisfies the different conditions of adjacent colored sets. The minimum number of colors required is the adjacent strong edge chromatic number. In this paper, we have obtained the adjacent strong edge chromatic number of path and wheel join-graph when m, n takes any value. |
| |
| Keywords: | path wheel join-graph adjacent strong edge chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
