安徽大学学报（自然科学版）2012，Vol.36Issue(1)：33-37,5.
路与路联图的邻强边染色和均匀邻强边染色
Adjacent strong edge coloring and equitable adjacent strong edge coloring of the joins of paths
摘要
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 colors i andj,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.关键词
邻强边染色/均匀邻强边染色/路的联图/最大度Key words
adjacent strong edge coloring/equitable adjacent strong edge coloring/joins of paths/maximum degree.分类
数理科学引用本文复制引用
王涛,赵宜宾,李德明..路与路联图的邻强边染色和均匀邻强边染色[J].安徽大学学报（自然科学版）,2012,36(1):33-37,5.基金项目
Support byed National Natural Science Foundation ot China (10201022,10971144) （10201022,10971144）
Natural Science Foundation of Beijing City(1102015) （1102015）
Fundamental Research Funds for the Universities (2011B019). （2011B019）
