| 路与路联图的邻强边染色和均匀邻强边染色(英文) |
| |
| 引用本文： | 王涛,赵宜宾,李德明.路与路联图的邻强边染色和均匀邻强边染色(英文)[J].安徽大学学报(自然科学版),2012(1):33-37. |
| |
| 作者姓名： | 王涛 赵宜宾 李德明 |
| |
| 作者单位： | 华北科技学院基础部;防灾科技学院基础部;首都师范大学数学系 |
| |
| 基金项目： | Support byed National Natural Science Foundation of China(10201022,10971144);Natural Science Foundationof Beijing City(1102015);Fundamental Research Funds for the Universities(2011B019) |
| |
| 摘 要： | 对于图G的一个正常边染色c,如果相邻的点所关联的边集的色集不相等,c称为邻强边染色.图G的邻强边染色所需要的最小值称为图G的邻强边色数.如果每个色类所含的边数最多差一,c被称为均匀边染色,其最小值称为图G的均匀边色数.论文确定了路与路联图的邻强边染色数和均匀邻强边染色数.
|
| 关 键 词： | 邻强边染色 均匀邻强边染色 路的联图 最大度 |
Adjacent strong edge coloring and equitable adjacent strong edge coloring of the joins of paths |
| |
| WANG Tao,ZHAO Yi-bin,LI De-ming.Adjacent strong edge coloring and equitable adjacent strong edge coloring of the joins of paths[J].Journal of Anhui University(Natural Sciences),2012(1):33-37. |
| |
| Authors: | WANG Tao ZHAO Yi-bin LI De-ming |
| |
| Institution: | 1.Department of Basic Course,North China Institute of Science and Technology,Sanhe 065201,China;2.Department of Basic Course,Institute of Disaster Prevention Science and Technology,Sanhe 065201,China;3.Department of Mathematics,Capital Normal University,Beijing 100048,China) |
| |
| Abstract: | For a proper edge coloring c of a graph G,if the sets of colors of adjacent vertices are distinct,the edge coloring c is called an adjacent strong edge coloring of G.Let c-1(i) be the set of edges that are colored by i,if ‖c-1(i)-c-1(j)‖≤1 for any two colorsi and j,then c is an equitable edge coloring of G.The coloring c is an equitable adjacent strong edge coloring of G,if it is both adjacent strong edge coloring and equitable adjacent strong edge coloring.The least number of colors of such a coloring c is called the equitable adjacent strong edge chromatic index of G.In this paper,we obtained the adjacent strong edge chromatic index and the equitable adjacent strong edge chromatic index of the joins of paths. |
| |
| Keywords: | adjacent strong edge coloring equitable adjacent strong edge coloring joins of paths maximum degree |
| 本文献已被 CNKI 等数据库收录！ |
|
