Let G be a finite, simple, undirected and connected graph. The adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for a proper edge-coloring of G, in which no two adjacent vertices are incident to edges colored with the same set of colors. The minimum number of colors required for an adjacent vertex-distinguishing proper edgecoloring of G is called the adjacent vertex-distinguishing proper edge-chromatic index. In this paper, I compute adjacent vertex-distinguishing proper edge-chromatic index of strong product of graphs.
Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 14,
2, Article 36.
Available at: https://digitalcommons.pvamu.edu/aam/vol14/iss2/36