Edge colorings are a fundamental component of graph theory used to identify the optimal approach to improve discrete structures, particularly for issues like ordering and resource allocation. It indicates what number of hues are required to coloration the rims of a sketch such that no two adjoining edges percentage the identical hue. This study work investigates the mathematical features of edge colors and their software to discrete structures. The research focuses at upper and lower ranges of χ’(G) for various kinds of graphs, such as bipartite, planar, and complete graphs. This work contributes to the domains of combinatorial optimization in general as well as graph theory.