Strong chromatic indices of certain binary operations on graphs
S.T. Vikram, S. Balaji · Discrete Mathematics Algorithms and Applications · 2023
The strong edge-coloring of a graph G is a proper edge coloring such that all edges adjacent to any given edge receive different colors. Such an assignment of colors defines color classes all of which are induced matchings. The minimum number of color classes required for such an assignment of colors is defined as the strong chromatic index of a graph G. In this article, we discuss the strong chromatic index of graphs obtained by the amalgamation of two graphs, the rooted product of two graphs and the corona product of two graphs.