A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
An adjacent vertex distinguishing proper edge coloring of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meet the same set of colors. The minimum number of colors is called adjacent vertex distinguishing proper edge chromatic number of G. In this paper, we present a new heuristic intelligent algorithm to calculate the adjacent vertex distinguishing proper edge chromatic number of graphs. To be exact, the algorithm establishes two objective subfunctions and adoi:10.1142/s1793830915500445 fatcat:mlbznz4mfbar3mztxhtaauk6pu