Abstract
An adjacent vertex distinguishing proper edge coloring of a graph [Formula: see text] is a proper edge coloring of [Formula: see text] 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 [Formula: see text]. 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 a main objective function to find its optimal solutions by the conditions of adjacent vertex distinguishing proper edge coloring. Moreover, we test and analyze its feasibility, and the test results show that this algorithm can rapidly and efficiently calculate the adjacent vertex distinguishing proper edge chromatic number of graphs with fixed order, and its time complexity is less than [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
