对一个正常的边染色满足相邻点的色集不同的条件时,称为邻强边染色,其所用最少染色数称为邻强边色数。就路与轮的联图,得到了在m,n任意取值情况下的邻强边色数。
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.