论文部分内容阅读
An adjacent vertex distinguishing proper edge coloring of a graph G is a proper edge coloring such that no two adjacent vertices assign the same set of colors,where the color set of a vertex is the set of colors of edges incident.The minimum number of colors required to give G is called the adjacent vertex distinguishing proper edge chromatic number.In this paper,we propose a new heuristic intelligent algorithm to solve the adjacent vertex distinguishing proper edge coloring of graphs.According to the conditions of adjacent vertex distinguishing proper edge coloring,the algorithm establishes two objective subfunctions and a main objective function to find the optimal solutions.Using exchanging rule gradually,the algorithm will not terminate until the value of objective functions satisfy our requirements.The authors give detailed design steps about this algorithm,at the same time,they test and analyse for the feasibility.The test results show that this algorithm can rapidly and efficiently calculate adjacent vertex distinguishing proper edge chromatic number of a graph with fixed order,and the time complexity of this algorithm is less than O(n3).