| 一些图的Mycielski图的均匀邻强边染色 |
| |
| 引用本文： | 马效敏,马刚,张忠辅.一些图的Mycielski图的均匀邻强边染色[J].纯粹数学与应用数学,2010,26(4):581-586. |
| |
| 作者姓名： | 马效敏 马刚 张忠辅 |
| |
| 作者单位： | 西北民族大学科研处,甘肃,兰州,730030;西北民族大学数学与计算机科学学院,甘肃,兰州,730124;兰州交通大学应用数学研究所,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金，国家民委科研项目，西北民族大学中青年科研基金 |
| |
| 摘 要： | 如果图G的一个正常边染色满足相邻点的色集不同,且任意两种颜色所染边数目相差不超过1,则称为均匀邻强边染色,其所用最少染色数称为均匀邻强边色数.本文得到了路、圈、星和扇的Mycielski图的均匀邻强边色数.
|
| 关 键 词： | Mycielski图 均匀邻强边染色 均匀邻强边色数 |
On equitable adjacent strong edge coloring of Mycielski graph of some graphs |
| |
| MA Xiao-min,MA Gang,ZHANG Zhong-fu.On equitable adjacent strong edge coloring of Mycielski graph of some graphs[J].Pure and Applied Mathematics,2010,26(4):581-586. |
| |
| Authors: | MA Xiao-min MA Gang ZHANG Zhong-fu |
| |
| Institution: | MA Xiao-min 1 MA Gang 2 ZHANG Zhong-fu 3(1.Scientific Research Department,Northwest University for Nationalities,Lanzhou 730030,China,2.College of Mathematics , Computer Science,Lanzhou 730124,3.Institute of Applied Mathematics,Lanzhou Jiao Tong University,Lanzhou 730070,China) |
| |
| Abstract: | A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required minimum number of colors is called the equitable adjacent strong edge chromatic number.In this paper,we obtain the equitable adjacent strong edge chromatic numbers of mycielski graphs of pan,cycle,star,and fan. |
| |
| Keywords: | Mycielski graph equitable adjacent strong edge coloring equitable adjacent strong edge chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
