The edge weight of a graph G is defined to be \(\max \{d_G(u) + d_G(v): uv \in E(G)\}\). The strong chromatic index of a graph is the minimum value of k such that the edge set of G can be partitioned into k induced matchings. In this article, we prove that the strong chromatic index of a graph with edge weight eight is at most 21.

中文翻译：

---

边权重为8的图的强色指数

图G的边缘权重定义为\（\ max \ {d_G（u）+ d_G（v）：uv \ in E（G）\} \）。图的强色指数是k的最小值，因此G的边集可以划分为k个诱导匹配。在本文中，我们证明边权重为8的图的强色度指数最多为21。