Strong Edge Coloring of Graphs via an Algorithmic Approach

Strong edge coloring is one of the important and challenging problems in graph theory, with diverse applications in areas such as communication network design, scheduling, and resource optimization. The objective of this problem is to find the minimum number of colors required to color the edges of a graph such that any two edges that are either adjacent or share a common neighbor receive different colors. Since determining the strong edge chromatic number is an NP-hard problem, metaheuristic approaches can provide effective strategies to approximate the optimal solution. In this study, a genetic algorithm is introduced as an evolutionary and efficient method for approximating the strong edge chromatic number. Furthermore, the performance of the proposed algorithm is implemented and analyzed on an important class of graphs.

کلیدواژه ها:

Graph ، coloring ، strong edge coloring ، genetic algorithm